Ronald Cramer

Affiliations:
  • National Research Institute for Mathematics and Computer Science, Amsterdam, Netherlands


According to our database1, Ronald Cramer authored at least 98 papers between 1993 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Vector Commitments over Rings and Compressed Σ-Protocols.
IACR Cryptol. ePrint Arch., 2022

2021
Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time.
J. ACM, 2021

A Compressed Σ-Protocol Theory for Lattices.
IACR Cryptol. ePrint Arch., 2021

Improved single-round secure multiplication using regenerating codes.
IACR Cryptol. ePrint Arch., 2021

Secure Computation over Integers Modulo Powers of Two.
ERCIM News, 2021

Asymptotically-Good Arithmetic Secret Sharing over $\mathbb {Z}/p^{\ell }\mathbb {Z}$ with Strong Multiplication and Its Applications to Efficient MPC.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

A Compressed $\varSigma $-Protocol Theory for Lattices.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Compressed $\varSigma $-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex.
IEEE Trans. Inf. Theory, 2020

Compressed Sigma-Protocols for Bilinear Circuits and Applications to Logarithmic-Sized Transparent Threshold Signature Schemes.
IACR Cryptol. ePrint Arch., 2020

Compressing Proofs of k-Out-Of-n Partial Knowledge.
IACR Cryptol. ePrint Arch., 2020

Compressed Σ-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics.
IACR Cryptol. ePrint Arch., 2020

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z.
IACR Cryptol. ePrint Arch., 2020

Compressed $\varSigma $-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019
On the Complexity of Arithmetic Secret Sharing.
IACR Cryptol. ePrint Arch., 2019

Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes.
IACR Cryptol. ePrint Arch., 2019

Asymptotically-Good Arithmetic Secret Sharing over Z/(p^\ell Z) with Strong Multiplication and Its Applications to Efficient MPC.
IACR Cryptol. ePrint Arch., 2019

A note on short invertible ring elements and applications to cyclotomic and trinomials number fields.
IACR Cryptol. ePrint Arch., 2019

Efficient Information-Theoretic Secure Multiparty Computation over ℤ/p<sup>k</sup> ℤ via Galois Rings.
IACR Cryptol. ePrint Arch., 2019

2018
SPDℤ<sub>2<sup>k</sup></sub>: Efficient MPC mod 2<sup>k</sup> for Dishonest Majority.
IACR Cryptol. ePrint Arch., 2018

Amortized Complexity of Information-Theoretically Secure MPC Revisited.
IACR Cryptol. ePrint Arch., 2018

A New Approach to Privacy-Preserving Clinical Decision Support Systems for HIV Treatment.
CoRR, 2018

2017
Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

2016
Short Stickelberger Class Relations and application to Ideal-SVP.
IACR Cryptol. ePrint Arch., 2016

Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model.
IACR Cryptol. ePrint Arch., 2016

Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack.
IACR Cryptol. ePrint Arch., 2016

On Multi-Point Local Decoding of Reed-Muller Codes.
Electron. Colloquium Comput. Complex., 2016

2015
Squares of Random Linear Codes.
IEEE Trans. Inf. Theory, 2015

A Framework for Secure Computations With Two Non-Colluding Servers and Multiple Clients, Applied to Recommendations.
IEEE Trans. Inf. Forensics Secur., 2015

On Secret Sharing with Nonlinear Product Reconstruction.
SIAM J. Discret. Math., 2015

Recovering Short Generators of Principal Ideals in Cyclotomic Rings.
IACR Cryptol. ePrint Arch., 2015

Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions.
IACR Cryptol. ePrint Arch., 2015

An Improvement on the Hasse-Weil Bound and applications to Character Sums, Cryptography and Coding.
CoRR, 2015

Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Secure Multiparty Computation and Secret Sharing.
Cambridge University Press, ISBN: 9781107043053, 2015

2014
Torsion Limits and Riemann-Roch Systems for Function Fields and Applications.
IEEE Trans. Inf. Theory, 2014

On the Amortized Complexity of Zero-Knowledge Protocols.
J. Cryptol., 2014

Optimal Algebraic Manipulation Detection Codes.
IACR Cryptol. ePrint Arch., 2014

On powers of codes.
IACR Cryptol. ePrint Arch., 2014

2013
Bounds on the Threshold Gap in Secret Sharing and its Applications.
IEEE Trans. Inf. Theory, 2013

2012
Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields.
IEEE Trans. Inf. Theory, 2012

The Arithmetic Codex.
IACR Cryptol. ePrint Arch., 2012

Bounds on the Threshold Gap in Secret Sharing over Small Fields.
IACR Cryptol. ePrint Arch., 2012

2011
On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations.
IACR Cryptol. ePrint Arch., 2011

DDH-like Assumptions Based on Extension Rings.
IACR Cryptol. ePrint Arch., 2011

The Arithmetic Codex: Theory and Applications.
Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010
A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

2009
Chosen-ciphertext Secure Encryption from Hard Algebraic Set Systems.
IACR Cryptol. ePrint Arch., 2009

Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over <i>Any</i> Fixed Finite Field.
Proceedings of the Advances in Cryptology, 2009

On the Amortized Complexity of Zero-Knowledge Protocols.
Proceedings of the Advances in Cryptology, 2009

2008
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes.
IEEE Trans. Inf. Theory, 2008

Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors.
IACR Cryptol. ePrint Arch., 2008

Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves.
Proceedings of the Advances in Cryptology, 2008

2007
Atomic Secure Multi-party Multiplication with Low Communication.
Proceedings of the Advances in Cryptology, 2007

Secure Computation from Random Error Correcting Codes.
Proceedings of the Advances in Cryptology, 2007

07381 Abstracts Collection -- Cryptography.
Proceedings of the Cryptography, 16.09. - 21.09.2007, 2007

07381 Executive Summary - Cryptography.
Proceedings of the Cryptography, 16.09. - 21.09.2007, 2007

A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra.
Proceedings of the Advances in Cryptology, 2007

Bounded CCA2-Secure Encryption.
Proceedings of the Advances in Cryptology, 2007

2006
A Note on Bounded Chosen Ciphertext Security from Black-box Semantical Security.
IACR Cryptol. ePrint Arch., 2006

Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields.
Proceedings of the Advances in Cryptology, 2006

Asymptotically Optimal Two-Round Perfectly Secure Message Transmission.
Proceedings of the Advances in Cryptology, 2006

2005
Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields.
Proceedings of the Advances in Cryptology, 2005

Contemporary cryptology.
Advanced courses in mathematics : CRM Barcelona, Birkhäuser, ISBN: 978-3-7643-7294-1, 2005

2004
On codes, matroids and secure multi-party computation from linear secret sharing schemes.
IACR Cryptol. ePrint Arch., 2004

Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation.
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

2003
Efficient Multi-Party Computation over Rings.
IACR Cryptol. ePrint Arch., 2003

2002
Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups.
IACR Cryptol. ePrint Arch., 2002

Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments.
Proceedings of the Advances in Cryptology, 2002

2001
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack.
IACR Cryptol. ePrint Arch., 2001

Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption.
IACR Cryptol. ePrint Arch., 2001

Universal Hash Proofs and and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
Electron. Colloquium Comput. Complex., 2001

On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase.
Proceedings of the Advances in Cryptology, 2001

Secure Distributed Linear Algebra in a Constant Number of Rounds.
Proceedings of the Advances in Cryptology, 2001

2000
Signature schemes based on the strong RSA assumption.
ACM Trans. Inf. Syst. Secur., 2000

Multiparty Computation from Threshold Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2000

Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions.
IACR Cryptol. ePrint Arch., 2000

General Secure Multi-Party Computation from any Linear Secret Sharing Scheme.
IACR Cryptol. ePrint Arch., 2000

On the Complexity of Verifiable Secret Sharing and Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2000

On the complexity of verifiable secret sharing and multiparty computation.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999
Efficient Multiparty Computations Secure Against an Adaptive Adversary.
Proceedings of the Advances in Cryptology, 1999

1998
A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack.
IACR Cryptol. ePrint Arch., 1998

Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?
Proceedings of the Advances in Cryptology, 1998

Introduction to Secure Computation.
Proceedings of the Lectures on Data Security, 1998

1997
A secure and optimally efficient multi-authority election scheme.
Eur. Trans. Telecommun., 1997

Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation.
Proceedings of the Advances in Cryptology, 1997

1996
Linear Zero-Knowledge - A note on Efficient Zero-Knowledge Proofs and Arguments.
IACR Cryptol. ePrint Arch., 1996

On Monotone Function Closure of Statistical Zero-Knowledge.
IACR Cryptol. ePrint Arch., 1996

Efficient and Provable Security Amplifications.
Proceedings of the Security Protocols, 1996

Multi-Autority Secret-Ballot Elections with Linear Work.
Proceedings of the Advances in Cryptology, 1996

New Generation of Secure and Practical RSA-Based Signatures.
Proceedings of the Advances in Cryptology, 1996

1995
Secure Signature Schemes based on Interactive Protocols.
Proceedings of the Advances in Cryptology, 1995

1994

Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols.
Proceedings of the Advances in Cryptology, 1994

1993
Improved Privacy in Wallets with Observers (Extended Abstract).
Proceedings of the Advances in Cryptology, 1993


  Loading...