Ronald Cramer

Publication Activity (10 Years)

Years Active: 1993-2022
Publications (10 Years): 42

Top Venues

IACR Cryptol. ePrint Arch.

IEEE Trans. Inf. Theory

CoRR

TCC (1)

Publications

Thomas Attema, Ignacio Cascudo, Ronald Cramer, Ivan Bjerre Damgård, Daniel Escudero
Vector Commitments over Rings and Compressed Σ-Protocols. IACR Cryptol. ePrint Arch. 2022 (2022)
Thomas Attema, Ignacio Cascudo, Ronald Cramer, Ivan Damgård, Daniel Escudero
Vector Commitments over Rings and Compressed $\varSigma $-Protocols. TCC (1) (2022)
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
New Approach to Privacy-Preserving Clinical Decision Support Systems for HIV Treatment. J. Medical Syst. 46 (12) (2022)
Ronald Cramer, Matthieu Rambaud, Chaoping Xing
Asymptotically-Good Arithmetic Secret Sharing over $\mathbb {Z}/p^{\ell }\mathbb {Z}$ with Strong Multiplication and Its Applications to Efficient MPC. CRYPTO (3) (2021)
Thomas Attema, Ronald Cramer, Lisa Kohl
A Compressed Σ-Protocol Theory for Lattices. IACR Cryptol. ePrint Arch. 2021 (2021)
Mark Abspoel, Ronald Cramer, Daniel Escudero, Ivan Damgård, Chaoping Xing
Improved Single-Round Secure Multiplication Using Regenerating Codes. ASIACRYPT (2) (2021)
Thomas Attema, Ronald Cramer, Matthieu Rambaud
Compressed $\varSigma $-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures. ASIACRYPT (4) (2021)
Mark Abspoel, Ronald Cramer, Daniel Escudero
Secure Computation over Integers Modulo Powers of Two. ERCIM News 2021 (126) (2021)
Ronald Cramer, Léo Ducas, Benjamin Wesolowski
Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time. J. ACM 68 (2) (2021)
Mark Abspoel, Ronald Cramer, Daniel Escudero, Ivan Damgård, Chaoping Xing
Improved single-round secure multiplication using regenerating codes. IACR Cryptol. ePrint Arch. 2021 (2021)
Thomas Attema, Ronald Cramer, Serge Fehr
Compressing Proofs of k-Out-Of-n Partial Knowledge. CRYPTO (4) (2021)
Thomas Attema, Ronald Cramer, Lisa Kohl
A Compressed $\varSigma $-Protocol Theory for Lattices. CRYPTO (2) (2021)
Ronald Cramer, Chaoping Xing, Chen Yuan
On the Complexity of Arithmetic Secret Sharing. TCC (3) (2020)
Thomas Attema, Ronald Cramer, Serge Fehr
Compressing Proofs of k-Out-Of-n Partial Knowledge. IACR Cryptol. ePrint Arch. 2020 (2020)
Thomas Attema, Ronald Cramer
Compressed Σ-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics. IACR Cryptol. ePrint Arch. 2020 (2020)
Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Matthieu Rambaud, Chaoping Xing, Chen Yuan
Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $. ASIACRYPT (3) (2020)
Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Matthieu Rambaud, Chaoping Xing, Chen Yuan
Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z. IACR Cryptol. ePrint Arch. 2020 (2020)
Ronald Cramer, Chaoping Xing, Chen Yuan
Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex. IEEE Trans. Inf. Theory 66 (1) (2020)
Thomas Attema, Ronald Cramer, Matthieu Rambaud
Compressed Sigma-Protocols for Bilinear Circuits and Applications to Logarithmic-Sized Transparent Threshold Signature Schemes. IACR Cryptol. ePrint Arch. 2020 (2020)
Ronald Cramer, Chaoping Xing
Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes. EUROCRYPT (1) (2020)
Thomas Attema, Ronald Cramer
Compressed $\varSigma $-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics. CRYPTO (3) (2020)
Ronald Cramer, Matthieu Rambaud, Chaoping Xing
Asymptotically-Good Arithmetic Secret Sharing over Z/(p^\ell Z) with Strong Multiplication and Its Applications to Efficient MPC. IACR Cryptol. ePrint Arch. 2019 (2019)
Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Chen Yuan
Z via Galois Rings. TCC (1) (2019)
Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Chen Yuan
ℤ via Galois Rings. IACR Cryptol. ePrint Arch. 2019 (2019)
Ronald Cramer, Chaoping Xing
Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes. IACR Cryptol. ePrint Arch. 2019 (2019)
Ronald Cramer, Chaoping Xing, Chen Yuan
On the Complexity of Arithmetic Secret Sharing. IACR Cryptol. ePrint Arch. 2019 (2019)
Thomas Attema, Ronald Cramer, Chaoping Xing
A note on short invertible ring elements and applications to cyclotomic and trinomials number fields. IACR Cryptol. ePrint Arch. 2019 (2019)
Ignacio Cascudo, Ronald Cramer, Chaoping Xing, Chen Yuan
Amortized Complexity of Information-Theoretically Secure MPC Revisited. IACR Cryptol. ePrint Arch. 2018 (2018)
Ronald Cramer, Ivan Damgård, Daniel Escudero, Peter Scholl, Chaoping Xing
for Dishonest Majority. IACR Cryptol. ePrint Arch. 2018 (2018)
Thomas Attema, Emiliano Mancini, Gabriele Spini, Mark Abspoel, Jan de Gier, Serge Fehr, Thijs Veugen, Maran van Heesch, Daniël Worm, Andrea De Luca, Ronald Cramer, Peter M. A. Sloot
A New Approach to Privacy-Preserving Clinical Decision Support Systems for HIV Treatment. CoRR (2018)
Ignacio Cascudo, Ronald Cramer, Chaoping Xing, Chen Yuan
Amortized Complexity of Information-Theoretically Secure MPC Revisited. CRYPTO (3) (2018)
Ronald Cramer, Ivan Damgård, Daniel Escudero, Peter Scholl, Chaoping Xing
for Dishonest Majority. CRYPTO (2) (2018)
Ronald Cramer, Léo Ducas, Benjamin Wesolowski
Short Stickelberger Class Relations and Application to Ideal-SVP. EUROCRYPT (1) (2017)
Ronald Cramer, Ivan Damgård, Chaoping Xing, Chen Yuan
Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack. EUROCRYPT (1) (2017)
Ronald Cramer, Ivan Damgård, Nico Döttling, Irene Giacomelli, Chaoping Xing
Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. ICITS (2017)
Ronald Cramer, Chaoping Xing, Chen Yuan
On Multi-Point Local Decoding of Reed-Muller Codes. Electron. Colloquium Comput. Complex. 23 (2016)
Ronald Cramer, Léo Ducas, Benjamin Wesolowski
Short Stickelberger Class Relations and application to Ideal-SVP. IACR Cryptol. ePrint Arch. 2016 (2016)
Ronald Cramer, Chaoping Xing, Chen Yuan
On Multi-Point Local Decoding of Reed-Muller Codes. CoRR (2016)
Ronald Cramer, Chaoping Xing, Chen Yuan
On Multi-Point Local Decoding of Reed-Muller Codes. IACR Cryptol. ePrint Arch. 2016 (2016)
Ronald Cramer, Ivan Damgård, Nico Döttling, Irene Giacomelli, Chaoping Xing
Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. IACR Cryptol. ePrint Arch. 2016 (2016)
Ronald Cramer, Léo Ducas, Chris Peikert, Oded Regev
Recovering Short Generators of Principal Ideals in Cyclotomic Rings. EUROCRYPT (2) (2016)
Ronald Cramer, Ivan Damgård
Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack. IACR Cryptol. ePrint Arch. 2016 (2016)
Thijs Veugen, Robbert de Haan, Ronald Cramer, Frank Muller
A Framework for Secure Computations With Two Non-Colluding Servers and Multiple Clients, Applied to Recommendations. IEEE Trans. Inf. Forensics Secur. 10 (3) (2015)
Ronald Cramer, Ivan Bjerre Damgård, Nico Döttling, Serge Fehr, Gabriele Spini
Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions. EUROCRYPT (2) (2015)
Ronald Cramer, Ivan Damgård, Marcel Keller
On the Amortized Complexity of Zero-knowledge Protocols. IACR Cryptol. ePrint Arch. 2015 (2015)
Ronald Cramer, Ivan Bjerre Damgård, Nico Döttling, Serge Fehr, Gabriele Spini
Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions. IACR Cryptol. ePrint Arch. 2015 (2015)
Ronald Cramer, Léo Ducas, Chris Peikert, Oded Regev
Recovering Short Generators of Principal Ideals in Cyclotomic Rings. IACR Cryptol. ePrint Arch. 2015 (2015)
Ronald Cramer, Chaoping Xing
An Improvement on the Hasse-Weil Bound and applications to Character Sums, Cryptography and Coding. CoRR (2015)
Ignacio Cascudo, Ronald Cramer, Diego Mirandola, Carles Padró, Chaoping Xing
On Secret Sharing with Nonlinear Product Reconstruction. SIAM J. Discret. Math. 29 (2) (2015)
Ronald Cramer, Carles Padró, Chaoping Xing
Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model. TCC (1) (2015)
Ignacio Cascudo, Ronald Cramer, Diego Mirandola, Gilles Zémor
Squares of Random Linear Codes. IEEE Trans. Inf. Theory 61 (3) (2015)
Ignacio Cascudo, Ronald Cramer, Chaoping Xing
Torsion Limits and Riemann-Roch Systems for Function Fields and Applications. IACR Cryptol. ePrint Arch. 2014 (2014)
Ignacio Cascudo, Ronald Cramer, Chaoping Xing
Torsion Limits and Riemann-Roch Systems for Function Fields and Applications. IEEE Trans. Inf. Theory 60 (7) (2014)
Ronald Cramer, Ivan Damgård, Marcel Keller
On the Amortized Complexity of Zero-Knowledge Protocols. J. Cryptol. 27 (2) (2014)
Ignacio Cascudo, Ronald Cramer, Diego Mirandola, Gilles Zémor
On powers of codes. CoRR (2014)
Ignacio Cascudo, Ronald Cramer, Diego Mirandola, Gilles Zémor
On powers of codes. IACR Cryptol. ePrint Arch. 2014 (2014)
Ronald Cramer, Carles Padró, Chaoping Xing
Optimal Algebraic Manipulation Detection Codes. IACR Cryptol. ePrint Arch. 2014 (2014)
Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing
Bounds on the Threshold Gap in Secret Sharing and its Applications. IEEE Trans. Inf. Theory 59 (9) (2013)
Ignacio Cascudo Pueyo, Ronald Cramer, Diego Mirandola, Carles Padró, Chaoping Xing
On secret sharing with nonlinear product reconstruction. IACR Cryptol. ePrint Arch. 2013 (2013)
Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing
Torsion Limits and Riemann-Roch Systems for Function Fields and Applications CoRR (2012)
Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing, An Yang
Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields. IEEE Trans. Inf. Theory 58 (7) (2012)
Ignacio Cascudo, Ronald Cramer, Chaoping Xing
The arithmetic codex. ITW (2012)
Ronald Cramer, Ivan Damgård, Valerio Pastro
On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations. ICITS (2012)
Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing
The Arithmetic Codex. IACR Cryptol. ePrint Arch. 2012 (2012)
Ronald Cramer, Ivan Damgård, Eike Kiltz, Sarah Zakarias, Angela Zottarel
DDH-Like Assumptions Based on Extension Rings. Public Key Cryptography (2012)
Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing
Bounds on the Threshold Gap in Secret Sharing over Small Fields. IACR Cryptol. ePrint Arch. 2012 (2012)
Ignacio Cascudo Pueyo, Ronald Cramer, Chaoping Xing
The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing. CRYPTO (2011)
Ronald Cramer, Ivan Damgård, Valerio Pastro
On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations. IACR Cryptol. ePrint Arch. 2011 (2011)
Ronald Cramer, Ivan Damgård, Eike Kiltz, Sarah Zakarias, Angela Zottarel
DDH-like Assumptions Based on Extension Rings. IACR Cryptol. ePrint Arch. 2011 (2011)
Ronald Cramer
The Arithmetic Codex: Theory and Applications. EUROCRYPT (2011)
Ronald Cramer, Dennis Hofheinz, Eike Kiltz
A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems. TCC (2010)
Ronald Cramer, Ivan Damgård
On the Amortized Complexity of Zero-Knowledge Protocols. CRYPTO (2009)
Ronald Cramer, Dennis Hofheinz, Eike Kiltz
Chosen-ciphertext Secure Encryption from Hard Algebraic Set Systems. IACR Cryptol. ePrint Arch. 2009 (2009)
Ignacio Cascudo Pueyo, Hao Chen, Ronald Cramer, Chaoping Xing
Fixed Finite Field. CRYPTO (2009)
Hao Chen, Ronald Cramer, Robbert de Haan, Ignacio Cascudo Pueyo
Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves. EUROCRYPT (2008)
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge Jiménez Urroz, Gregor Leander, Jaume Martí-Farré, Carles Padró
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes. IEEE Trans. Inf. Theory 54 (6) (2008)
Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles Padró, Daniel Wichs
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors. IACR Cryptol. ePrint Arch. 2008 (2008)
Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles Padró, Daniel Wichs
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors. EUROCRYPT (2008)
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert de Haan, Vinod Vaikuntanathan
Secure Computation from Random Error Correcting Codes. EUROCRYPT (2007)
Ronald Cramer, Goichiro Hanaoka, Dennis Hofheinz, Hideki Imai, Eike Kiltz, Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan
Bounded CCA2-Secure Encryption. ASIACRYPT (2007)
Johannes Blömer, Dan Boneh, Ronald Cramer, Ueli M. Maurer
07381 Executive Summary - Cryptography. Cryptography (2007)
Ronald Cramer, Eike Kiltz, Carles Padró
A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra. CRYPTO (2007)
Johannes Blömer, Dan Boneh, Ronald Cramer, Ueli M. Maurer
07381 Abstracts Collection -- Cryptography. Cryptography (2007)
Ronald Cramer, Ivan Damgård, Robbert de Haan
Atomic Secure Multi-party Multiplication with Low Communication. EUROCRYPT (2007)
Ronald Cramer, Dennis Hofheinz, Eike Kiltz
A Note on Bounded Chosen Ciphertext Security from Black-box Semantical Security. IACR Cryptol. ePrint Arch. 2006 (2006)
Hao Chen, Ronald Cramer
Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields. CRYPTO (2006)
Saurabh Agarwal, Ronald Cramer, Robbert de Haan
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission. CRYPTO (2006)
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge Jiménez Urroz, Gregor Leander, Jaume Martí-Farré, Carles Padró
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes. CRYPTO (2005)
Ronald Cramer, Ivan Damgård, Yuval Ishai
Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation. TCC (2005)
Ronald Cramer, Serge Fehr, Martijn Stam
Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields. CRYPTO (2005)
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge Jiménez Urroz, Gregor Leander, Jaume Martí-Farré, Carles Padró
On codes, matroids and secure multi-party computation from linear secret sharing schemes. IACR Cryptol. ePrint Arch. 2004 (2004)
Ronald Cramer, Ivan Damgård
Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation. TCC (2004)
Ronald Cramer, Victor Shoup
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack. SIAM J. Comput. 33 (1) (2003)
Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz
Efficient Multi-Party Computation over Rings. IACR Cryptol. ePrint Arch. 2003 (2003)
Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz
Efficient Multi-party Computation over Rings. EUROCRYPT (2003)
Ronald Cramer, Serge Fehr
Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups. IACR Cryptol. ePrint Arch. 2002 (2002)
Ronald Cramer, Victor Shoup
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. EUROCRYPT (2002)
Masayuki Abe, Ronald Cramer, Serge Fehr
Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments. ASIACRYPT (2002)
Ronald Cramer, Serge Fehr
Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups. CRYPTO (2002)
Ronald Cramer, Ivan Damgård
Secure Distributed Linear Algebra in a Constant Number of Rounds. CRYPTO (2001)

Ronald Cramer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ronald Cramer