Improved Privacy in Wallets with Observers (Extended Abstract). - Ronald Cramer; Torben P. Pedersen (EUROCRYPT, 1993)

Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. - Ronald Cramer; Ivan Damgård; Berry Schoenmakers (CRYPTO, 1994)

The ESPRIT Project CAFE - High Security Digital Payment Systems. - Jean-Paul Boly; Antoon Bosselaers; Ronald Cramer; Rolf Michelsen; Stig Fr. Mjølsnes; Frank Muller; Torben P. Pedersen; Birgit Pfitzmann; Peter de Rooij; Berry Schoenmakers; Matthias Schunter; Luc Vallée; et al. (ESORICS, 1994)

Secure Signature Schemes based on Interactive Protocols. - Ronald Cramer; Ivan Damgård (CRYPTO, 1995)

New Generation of Secure and Practical RSA-Based Signatures. - Ronald Cramer; Ivan Damgård (CRYPTO, 1996)

Multi-Autority Secret-Ballot Elections with Linear Work. - Ronald Cramer; Matthew K. Franklin; Berry Schoenmakers; Moti Yung (EUROCRYPT, 1996)

Efficient and Provable Security Amplifications. - Ronald Cramer; Ivan Damgård; Torben P. Pedersen (Security Protocols Workshop, 1996)

On Monotone Function Closure of Statistical Zero-Knowledge. - Ronald Cramer; Ivan Damgård (IACR Cryptol. ePrint Arch., 1996)

Linear Zero-Knowledge - A note on Efficient Zero-Knowledge Proofs and Arguments. - Ronald Cramer; Ivan Damgård (IACR Cryptol. ePrint Arch., 1996)

Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation. - Ronald Cramer; Ivan Damgård (EUROCRYPT, 1997)

A secure and optimally efficient multi-authority election scheme. - Ronald Cramer; Rosario Gennaro; Berry Schoenmakers (Eur. Trans. Telecommun., 1997)

Introduction to Secure Computation. - Ronald Cramer (Lectures on Data Security, 1998)

Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free? - Ronald Cramer; Ivan Damgård (CRYPTO, 1998)

A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack. - Ronald Cramer; Victor Shoup (IACR Cryptol. ePrint Arch., 1998)

Efficient Multiparty Computations Secure Against an Adaptive Adversary. - Ronald Cramer; Ivan Damgård; Stefan Dziembowski; Martin Hirt; Tal Rabin (EUROCRYPT, 1999)

On the complexity of verifiable secret sharing and multiparty computation. - Ronald Cramer; Ivan Damgård; Stefan Dziembowski (STOC, 2000)

On the Complexity of Verifiable Secret Sharing and Multi-Party Computation. - Ronald Cramer; Ivan Damgård; Stefan Dziembowski (IACR Cryptol. ePrint Arch., 2000)

General Secure Multi-Party Computation from any Linear Secret Sharing Scheme. - Ronald Cramer; Ivan Damgård; Ueli Maurer (IACR Cryptol. ePrint Arch., 2000)

Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions. - Ronald Cramer; Ivan Damgård; Philip D. MacKenzie (IACR Cryptol. ePrint Arch., 2000)

Multiparty Computation from Threshold Homomorphic Encryption. - Ronald Cramer; Ivan Damgård; Jesper Buus Nielsen (IACR Cryptol. ePrint Arch., 2000)

Signature schemes based on the strong RSA assumption. - Ronald Cramer; Victor Shoup (ACM Trans. Inf. Syst. Secur., 2000)

Secure Distributed Linear Algebra in a Constant Number of Rounds. - Ronald Cramer; Ivan Damgård (CRYPTO, 2001)

On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase. - Ronald Cramer; Ivan Damgård; Serge Fehr (CRYPTO, 2001)

Universal Hash Proofs and and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption - Ronald Cramer; Victor Shoup (Electron. Colloquium Comput. Complex., 2001)

Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. - Ronald Cramer; Victor Shoup (IACR Cryptol. ePrint Arch., 2001)

Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments. - Masayuki Abe; Ronald Cramer; Serge Fehr (ASIACRYPT, 2002)

Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups. - Ronald Cramer; Serge Fehr (IACR Cryptol. ePrint Arch., 2002)

Efficient Multi-Party Computation over Rings. - Ronald Cramer; Serge Fehr; Yuval Ishai; Eyal Kushilevitz (IACR Cryptol. ePrint Arch., 2003)

Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack. - Ronald Cramer; Victor Shoup (SIAM J. Comput., 2003)

Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation. - Ronald Cramer; Ivan Damgård (TCC, 2004)

On codes, matroids and secure multi-party computation from linear secret sharing schemes. - Ronald Cramer; Vanesa Daza; Ignacio Gracia; Jorge Jiménez Urroz; Gregor Leander; Jaume Martí-Farré; Carles Padró (IACR Cryptol. ePrint Arch., 2004)

Contemporary cryptology. - Dario Catalano; Ronald Cramer; Ivan Bjerre Damgård; Giovanni Di Crescenzo; David Pointcheval (Birkhäuser, 2005)

Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields. - Ronald Cramer; Serge Fehr; Martijn Stam (CRYPTO, 2005)

Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation. - Ronald Cramer; Ivan Damgård; Yuval Ishai (TCC, 2005)

Asymptotically Optimal Two-Round Perfectly Secure Message Transmission. - Saurabh Agarwal; Ronald Cramer; Robbert de Haan (CRYPTO, 2006)

Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields. - Hao Chen 095; Ronald Cramer (CRYPTO, 2006)

A Note on Bounded Chosen Ciphertext Security from Black-box Semantical Security. - Ronald Cramer; Dennis Hofheinz; Eike Kiltz (IACR Cryptol. ePrint Arch., 2006)

Bounded CCA2-Secure Encryption. - Ronald Cramer; Goichiro Hanaoka; Dennis Hofheinz; Hideki Imai; Eike Kiltz; Rafael Pass; Abhi Shelat; Vinod Vaikuntanathan (ASIACRYPT, 2007)

A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra. - Ronald Cramer; Eike Kiltz; Carles Padró (CRYPTO, 2007)

07381 Executive Summary - Cryptography. - Johannes Blömer; Dan Boneh; Ronald Cramer; Ueli M. Maurer (Cryptography, 2007)

07381 Abstracts Collection – Cryptography. - Johannes Blömer; Dan Boneh; Ronald Cramer; Ueli M. Maurer (Cryptography, 2007)

Secure Computation from Random Error Correcting Codes. - Hao Chen 095; Ronald Cramer; Shafi Goldwasser; Robbert de Haan; Vinod Vaikuntanathan (EUROCRYPT, 2007)

Atomic Secure Multi-party Multiplication with Low Communication. - Ronald Cramer; Ivan Damgård; Robbert de Haan (EUROCRYPT, 2007)

Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves. - Hao Chen 095; Ronald Cramer; Robbert de Haan; Ignacio Cascudo Pueyo (EUROCRYPT, 2008)

Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors. - Ronald Cramer; Yevgeniy Dodis; Serge Fehr; Carles Padró; Daniel Wichs (IACR Cryptol. ePrint Arch., 2008)

On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes. - Ronald Cramer; Vanesa Daza; Ignacio Gracia; Jorge Jiménez Urroz; Gregor Leander; Jaume Martí-Farré; Carles Padró (IEEE Trans. Inf. Theory, 2008)

On the Amortized Complexity of Zero-Knowledge Protocols. - Ronald Cramer; Ivan Damgård (CRYPTO, 2009)

Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field. - Ignacio Cascudo Pueyo; Hao Chen 095; Ronald Cramer; Chaoping Xing (CRYPTO, 2009)

Chosen-ciphertext Secure Encryption from Hard Algebraic Set Systems. - Ronald Cramer; Dennis Hofheinz; Eike Kiltz (IACR Cryptol. ePrint Arch., 2009)

A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems. - Ronald Cramer; Dennis Hofheinz; Eike Kiltz (TCC, 2010)

The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing. - Ignacio Cascudo Pueyo; Ronald Cramer; Chaoping Xing (CRYPTO, 2011)

The Arithmetic Codex: Theory and Applications. - Ronald Cramer (EUROCRYPT, 2011)

DDH-like Assumptions Based on Extension Rings. - Ronald Cramer; Ivan Damgård; Eike Kiltz; Sarah Zakarias; Angela Zottarel (IACR Cryptol. ePrint Arch., 2011)

On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations. - Ronald Cramer; Ivan Damgård; Valerio Pastro (IACR Cryptol. ePrint Arch., 2011)

Bounds on the Threshold Gap in Secret Sharing over Small Fields. - Ignacio Cascudo Pueyo; Ronald Cramer; Chaoping Xing (IACR Cryptol. ePrint Arch., 2012)

The Arithmetic Codex. - Ignacio Cascudo Pueyo; Ronald Cramer; Chaoping Xing (IACR Cryptol. ePrint Arch., 2012)

Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields. - Ignacio Cascudo Pueyo; Ronald Cramer; Chaoping Xing; An Yang (IEEE Trans. Inf. Theory, 2012)

Bounds on the Threshold Gap in Secret Sharing and its Applications. - Ignacio Cascudo Pueyo; Ronald Cramer; Chaoping Xing (IEEE Trans. Inf. Theory, 2013)

On powers of codes. - Ignacio Cascudo; Ronald Cramer; Diego Mirandola; Gilles Zémor (IACR Cryptol. ePrint Arch., 2014)

Optimal Algebraic Manipulation Detection Codes. - Ronald Cramer; Carles Padró; Chaoping Xing (IACR Cryptol. ePrint Arch., 2014)

On the Amortized Complexity of Zero-Knowledge Protocols. - Ronald Cramer; Ivan Damgård; Marcel Keller (J. Cryptol., 2014)

Torsion Limits and Riemann-Roch Systems for Function Fields and Applications. - Ignacio Cascudo; Ronald Cramer; Chaoping Xing (IEEE Trans. Inf. Theory, 2014)

Secure Multiparty Computation and Secret Sharing. - Ronald Cramer; Ivan Damgård; Jesper Buus Nielsen (Cambridge University Press, 2015)

Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model. - Ronald Cramer; Carles Padró; Chaoping Xing (TCC (1), 2015)

An Improvement on the Hasse-Weil Bound and applications to Character Sums, Cryptography and Coding. - Ronald Cramer; Chaoping Xing (CoRR, 2015)

Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions. - Ronald Cramer; Ivan Bjerre Damgård; Nico Döttling; Serge Fehr; Gabriele Spini (IACR Cryptol. ePrint Arch., 2015)

Recovering Short Generators of Principal Ideals in Cyclotomic Rings. - Ronald Cramer; Léo Ducas; Chris Peikert; Oded Regev 001 (IACR Cryptol. ePrint Arch., 2015)

On Secret Sharing with Nonlinear Product Reconstruction. - Ignacio Cascudo; Ronald Cramer; Diego Mirandola; Carles Padró; Chaoping Xing (SIAM J. Discret. Math., 2015)

A Framework for Secure Computations With Two Non-Colluding Servers and Multiple Clients, Applied to Recommendations. - Thijs Veugen; Robbert de Haan; Ronald Cramer; Frank Muller (IEEE Trans. Inf. Forensics Secur., 2015)

Squares of Random Linear Codes. - Ignacio Cascudo; Ronald Cramer; Diego Mirandola; Gilles Zémor (IEEE Trans. Inf. Theory, 2015)

On Multi-Point Local Decoding of Reed-Muller Codes. - Ronald Cramer; Chaoping Xing; Chen Yuan 003 (Electron. Colloquium Comput. Complex., 2016)

Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack. - Ronald Cramer; Ivan Damgård (IACR Cryptol. ePrint Arch., 2016)

Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. - Ronald Cramer; Ivan Damgård; Nico Döttling; Irene Giacomelli; Chaoping Xing (IACR Cryptol. ePrint Arch., 2016)

Short Stickelberger Class Relations and application to Ideal-SVP. - Ronald Cramer; Léo Ducas; Benjamin Wesolowski (IACR Cryptol. ePrint Arch., 2016)

Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack. - Ronald Cramer; Ivan Damgård; Chaoping Xing; Chen Yuan 003 (EUROCRYPT (1), 2017)

Amortized Complexity of Information-Theoretically Secure MPC Revisited. - Ignacio Cascudo; Ronald Cramer; Chaoping Xing; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2018)

SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority. - Ronald Cramer; Ivan Damgård; Daniel Escudero 001; Peter Scholl; Chaoping Xing (IACR Cryptol. ePrint Arch., 2018)

Efficient Information-Theoretic Secure Multiparty Computation over ℤ/pk ℤ via Galois Rings. - Mark Abspoel; Ronald Cramer; Ivan Damgård; Daniel Escudero 001; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2019)

A note on short invertible ring elements and applications to cyclotomic and trinomials number fields. - Thomas Attema; Ronald Cramer; Chaoping Xing (IACR Cryptol. ePrint Arch., 2019)

Asymptotically-Good Arithmetic Secret Sharing over Z/(p^ ell Z) with Strong Multiplication and Its Applications to Efficient MPC. - Ronald Cramer; Matthieu Rambaud; Chaoping Xing (IACR Cryptol. ePrint Arch., 2019)

Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes. - Ronald Cramer; Chaoping Xing (IACR Cryptol. ePrint Arch., 2019)

On the Complexity of Arithmetic Secret Sharing. - Ronald Cramer; Chaoping Xing; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2019)

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $ mathbb {Z}/p^k mathbb {Z} $. - Mark Abspoel; Ronald Cramer; Ivan Damgård; Daniel Escudero 001; Matthieu Rambaud; Chaoping Xing; Chen Yuan 003 (ASIACRYPT (3), 2020)

Compressed $ varSigma $-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics. - Thomas Attema; Ronald Cramer (CRYPTO (3), 2020)

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z. - Mark Abspoel; Ronald Cramer; Ivan Damgård; Daniel Escudero 001; Matthieu Rambaud; Chaoping Xing; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2020)

Compressed Σ-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics. - Thomas Attema; Ronald Cramer (IACR Cryptol. ePrint Arch., 2020)

Compressing Proofs of k-Out-Of-n Partial Knowledge. - Thomas Attema; Ronald Cramer; Serge Fehr (IACR Cryptol. ePrint Arch., 2020)

Compressed Sigma-Protocols for Bilinear Circuits and Applications to Logarithmic-Sized Transparent Threshold Signature Schemes. - Thomas Attema; Ronald Cramer; Matthieu Rambaud (IACR Cryptol. ePrint Arch., 2020)

Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex. - Ronald Cramer; Chaoping Xing; Chen Yuan 003 (IEEE Trans. Inf. Theory, 2020)

Compressed $ varSigma $-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures. - Thomas Attema; Ronald Cramer; Matthieu Rambaud (ASIACRYPT (4), 2021)

A Compressed $ varSigma $-Protocol Theory for Lattices. - Thomas Attema; Ronald Cramer; Lisa Kohl (CRYPTO (2), 2021)

Asymptotically-Good Arithmetic Secret Sharing over $ mathbb {Z}/p^{ ell } mathbb {Z}$ with Strong Multiplication and Its Applications to Efficient MPC. - Ronald Cramer; Matthieu Rambaud; Chaoping Xing (CRYPTO (3), 2021)

Secure Computation over Integers Modulo Powers of Two. - Mark Abspoel; Ronald Cramer; Daniel Escudero 001 (ERCIM News, 2021)

Improved single-round secure multiplication using regenerating codes. - Mark Abspoel; Ronald Cramer; Daniel Escudero 001; Ivan Damgård; Chaoping Xing (IACR Cryptol. ePrint Arch., 2021)

A Compressed Σ-Protocol Theory for Lattices. - Thomas Attema; Ronald Cramer; Lisa Kohl (IACR Cryptol. ePrint Arch., 2021)

Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time. - Ronald Cramer; Léo Ducas; Benjamin Wesolowski (J. ACM, 2021)

Vector Commitments over Rings and Compressed $ varSigma $-Protocols. - Thomas Attema; Ignacio Cascudo; Ronald Cramer; Ivan Damgård; Daniel Escudero 001 (TCC (1), 2022)

Vector Commitments over Rings and Compressed Σ-Protocols. - Thomas Attema; Ignacio Cascudo; Ronald Cramer; Ivan Bjerre Damgård; Daniel Escudero 001 (IACR Cryptol. ePrint Arch., 2022)

New Approach to Privacy-Preserving Clinical Decision Support Systems for HIV Treatment. - Gabriele Spini; Emiliano Mancini; Thomas Attema; Mark Abspoel; Jan de Gier; Serge Fehr; Thijs Veugen; Maran van Heesch; Daniël Worm; Andrea De Luca; Ronald Cramer; Peter M. A. Sloot (J. Medical Syst., 2022)