| 2022 | TCC | Vector Commitments over Rings and Compressed $\varSigma $-Protocols. | Thomas Attema, Ignacio Cascudo, Ronald Cramer, Ivan Damgrd, Daniel Escudero |
| 2021 | ASIACRYPT | Improved Single-Round Secure Multiplication Using Regenerating Codes. | Mark Abspoel, Ronald Cramer, Daniel Escudero, Ivan Damgrd, Chaoping Xing |
| 2021 | ASIACRYPT | Compressed $\varSigma $-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures. | Thomas Attema, Ronald Cramer, Matthieu Rambaud |
| 2021 | CRYPTO | Compressing Proofs of k-Out-Of-n Partial Knowledge. | Thomas Attema, Ronald Cramer, Serge Fehr |
| 2021 | CRYPTO | A Compressed $\varSigma $-Protocol Theory for Lattices. | Thomas Attema, Ronald Cramer, Lisa Kohl |
| 2021 | CRYPTO | 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 |
| 2020 | ASIACRYPT | Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $. | Mark Abspoel, Ronald Cramer, Ivan Damgrd, Daniel Escudero, Matthieu Rambaud, Chaoping Xing, Chen Yuan |
| 2020 | CRYPTO | Compressed $\varSigma $-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics. | Thomas Attema, Ronald Cramer |
| 2020 | EuroCrypt | Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes. | Ronald Cramer, Chaoping Xing |
| 2020 | TCC | On the Complexity of Arithmetic Secret Sharing. | Ronald Cramer, Chaoping Xing, Chen Yuan |
| 2019 | TCC | Efficient Information-Theoretic Secure Multiparty Computation over Z/p | Mark Abspoel, Ronald Cramer, Ivan Damgrd, Daniel Escudero, Chen Yuan |
| 2018 | CRYPTO | Amortized Complexity of Information-Theoretically Secure MPC Revisited. | Ignacio Cascudo, Ronald Cramer, Chaoping Xing, Chen Yuan |
| 2018 | CRYPTO | SPDℤ | Ronald Cramer, Ivan Damgrd, Daniel Escudero, Peter Scholl, Chaoping Xing |
| 2017 | EuroCrypt | Short Stickelberger Class Relations and Application to Ideal-SVP. | Ronald Cramer, Lo Ducas, Benjamin Wesolowski |
| 2017 | EuroCrypt | Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack. | Ronald Cramer, Ivan Damgrd, Chaoping Xing, Chen Yuan |
| 2016 | EuroCrypt | Recovering Short Generators of Principal Ideals in Cyclotomic Rings. | Ronald Cramer, Lo Ducas, Chris Peikert, Oded Regev |
| 2015 | EuroCrypt | Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions. | Ronald Cramer, Ivan Bjerre Damgrd, Nico Dttling, Serge Fehr, Gabriele Spini |
| 2015 | TCC | Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model. | Ronald Cramer, Carles Padr, Chaoping Xing |
| 2012 | ITW | The arithmetic codex. | Ignacio Cascudo, Ronald Cramer, Chaoping Xing |
| 2012 | PKC | DDH-Like Assumptions Based on Extension Rings. | Ronald Cramer, Ivan Damgrd, Eike Kiltz, Sarah Zakarias, Angela Zottarel |
| 2011 | CRYPTO | The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing. | Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing |
| 2011 | EuroCrypt | The Arithmetic Codex: Theory and Applications. | Ronald Cramer |
| 2010 | TCC | 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 |
| 2009 | CRYPTO | On the Amortized Complexity of Zero-Knowledge Protocols. | Ronald Cramer, Ivan Damgrd |
| 2009 | CRYPTO | Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over | Ignacio Cascudo Pueyo, Hao Chen, Ronald Cramer, Chaoping Xing |
| 2008 | EuroCrypt | Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves. | Hao Chen, Ronald Cramer, Robbert de Haan, Ignacio Cascudo Pueyo |
| 2008 | EuroCrypt | Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors. | Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles Padr, Daniel Wichs |
| 2007 | ASIACRYPT | Bounded CCA2-Secure Encryption. | Ronald Cramer, Goichiro Hanaoka, Dennis Hofheinz, Hideki Imai, Eike Kiltz, Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan |
| 2007 | CRYPTO | A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra. | Ronald Cramer, Eike Kiltz, Carles Padr |
| 2007 | EuroCrypt | Secure Computation from Random Error Correcting Codes. | Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert de Haan, Vinod Vaikuntanathan |
| 2007 | EuroCrypt | Atomic Secure Multi-party Multiplication with Low Communication. | Ronald Cramer, Ivan Damgrd, Robbert de Haan |
| 2006 | CRYPTO | Asymptotically Optimal Two-Round Perfectly Secure Message Transmission. | Saurabh Agarwal, Ronald Cramer, Robbert de Haan |
| 2006 | CRYPTO | Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields. | Hao Chen, Ronald Cramer |
| 2005 | CRYPTO | On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes. | Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge Jimnez Urroz, Gregor Leander, Jaume Mart-Farr, Carles Padr |
| 2005 | CRYPTO | Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields. | Ronald Cramer, Serge Fehr, Martijn Stam |
| 2005 | TCC | Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation. | Ronald Cramer, Ivan Damgrd, Yuval Ishai |
| 2004 | TCC | Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation. | Ronald Cramer, Ivan Damgrd |
| 2003 | EuroCrypt | Efficient Multi-party Computation over Rings. | Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz |
| 2002 | ASIACRYPT | Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments. | Masayuki Abe, Ronald Cramer, Serge Fehr |
| 2002 | CRYPTO | Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups. | Ronald Cramer, Serge Fehr |
| 2002 | EuroCrypt | Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. | Ronald Cramer, Victor Shoup |
| 2001 | CRYPTO | Secure Distributed Linear Algebra in a Constant Number of Rounds. | Ronald Cramer, Ivan Damgrd |
| 2001 | CRYPTO | On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase. | Ronald Cramer, Ivan Damgrd, Serge Fehr |
| 2001 | EuroCrypt | Multiparty Computation from Threshold Homomorphic Encryption. | Ronald Cramer, Ivan Damgrd, Jesper Buus Nielsen |
| 2000 | EuroCrypt | General Secure Multi-party Computation from any Linear Secret-Sharing Scheme. | Ronald Cramer, Ivan Damgrd, Ueli M. Maurer |
| 2000 | PKC | Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions. | Ronald Cramer, Ivan Damgrd, Philip D. MacKenzie |
| 2000 | STOC | On the complexity of verifiable secret sharing and multiparty computation. | Ronald Cramer, Ivan Damgrd, Stefan Dziembowski |
| 1999 | CCS | Signature Schemes Based on the Strong RSA Assumption. | Ronald Cramer, Victor Shoup |
| 1999 | EuroCrypt | Efficient Multiparty Computations Secure Against an Adaptive Adversary. | Ronald Cramer, Ivan Damgrd, Stefan Dziembowski, Martin Hirt, Tal Rabin |
| 1998 | CRYPTO | Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free? | Ronald Cramer, Ivan Damgrd |
| 1998 | CRYPTO | A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack. | Ronald Cramer, Victor Shoup |
| 1997 | EuroCrypt | Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation. | Ronald Cramer, Ivan Damgrd |
| 1997 | EuroCrypt | A Secure and Optimally Efficient Multi-Authority Election Scheme. | Ronald Cramer, Rosario Gennaro, Berry Schoenmakers |
| 1997 | STOC | Linear Zero-Knowledge - A Note on Efficient Zero-Knowledge Proofs and Arguments. | Ronald Cramer, Ivan Damgrd |
| 1996 | CRYPTO | New Generation of Secure and Practical RSA-Based Signatures. | Ronald Cramer, Ivan Damgrd |
| 1996 | EuroCrypt | Multi-Autority Secret-Ballot Elections with Linear Work. | Ronald Cramer, Matthew K. Franklin, Berry Schoenmakers, Moti Yung |
| 1995 | CRYPTO | Secure Signature Schemes based on Interactive Protocols. | Ronald Cramer, Ivan Damgrd |
| 1994 | CRYPTO | Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. | Ronald Cramer, Ivan Damgrd, Berry Schoenmakers |
| 1994 | ESORICS | The ESPRIT Project CAFE - High Security Digital Payment Systems. | Jean-Paul Boly, Antoon Bosselaers, Ronald Cramer, Rolf Michelsen, Stig Fr. Mjlsnes, Frank Muller, Torben P. Pedersen, Birgit Pfitzmann, Peter de Rooij, Berry Schoenmakers, Matthias Schunter, Luc Valle, Michael Waidner |
| 1993 | EuroCrypt | Improved Privacy in Wallets with Observers (Extended Abstract). | Ronald Cramer, Torben P. Pedersen |