Ronald Cramer
Affiliations:- National Research Institute for Mathematics and Computer Science, Amsterdam, Netherlands
According to our database1,
Ronald Cramer
authored at least 99 papers
between 1993 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on id.loc.gov
-
on d-nb.info
-
on isni.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2022
New Approach to Privacy-Preserving Clinical Decision Support Systems for HIV Treatment.
J. Medical Syst., 2022
IACR Cryptol. ePrint Arch., 2022
Proceedings of the Theory of Cryptography - 20th International Conference, 2022
2021
J. ACM, 2021
IACR Cryptol. ePrint Arch., 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
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
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
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
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
IACR Cryptol. ePrint Arch., 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
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack.
IACR Cryptol. ePrint Arch., 2016
Electron. Colloquium Comput. Complex., 2016
2015
A Framework for Secure Computations With Two Non-Colluding Servers and Multiple Clients, Applied to Recommendations.
IEEE Trans. Inf. Forensics Secur., 2015
SIAM J. Discret. Math., 2015
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
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015
Cambridge University Press, ISBN: 9781107043053, 2015
2014
IEEE Trans. Inf. Theory, 2014
2013
IEEE Trans. Inf. Theory, 2013
2012
Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields.
IEEE Trans. Inf. Theory, 2012
IACR Cryptol. ePrint Arch., 2012
2011
On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations.
IACR Cryptol. ePrint Arch., 2011
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
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
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
Proceedings of the Advances in Cryptology, 2008
2007
Proceedings of the Advances in Cryptology, 2007
Proceedings of the Advances in Cryptology, 2007
Proceedings of the Cryptography, 16.09. - 21.09.2007, 2007
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
2006
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
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
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
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004
2003
2002
IACR Cryptol. ePrint Arch., 2002
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
Proceedings of the Advances in Cryptology, 2001
Proceedings of the Advances in Cryptology, 2001
2000
ACM Trans. Inf. Syst. Secur., 2000
IACR Cryptol. ePrint Arch., 2000
IACR Cryptol. ePrint Arch., 2000
IACR Cryptol. ePrint Arch., 2000
IACR Cryptol. ePrint Arch., 2000
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000
1999
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
Proceedings of the Lectures on Data Security, 1998
1997
Eur. Trans. Telecommun., 1997
Proceedings of the Advances in Cryptology, 1997
1996
IACR Cryptol. ePrint Arch., 1996
IACR Cryptol. ePrint Arch., 1996
Proceedings of the Security Protocols, 1996
Proceedings of the Advances in Cryptology, 1996
Proceedings of the Advances in Cryptology, 1996
1995
Proceedings of the Advances in Cryptology, 1995
1994
Proceedings of the Computer Security, 1994
Proceedings of the Advances in Cryptology, 1994
1993
Proceedings of the Advances in Cryptology, 1993