Ronald Cramer
#67,645
Most Influential Person Now
Dutch computer scientist
Ronald Cramer's AcademicInfluence.com Rankings
Ronald Cramermathematics Degrees
Mathematics
#6858
World Rank
#9420
Historical Rank
Group Theory
#116
World Rank
#143
Historical Rank
Measure Theory
#2044
World Rank
#2477
Historical Rank
Download Badge
Computer Science Mathematics
Ronald Cramer's Degrees
- PhD Computer Science University of Amsterdam
- Masters Mathematics University of Amsterdam
Similar Degrees You Can Earn
Why Is Ronald Cramer Influential?
(Suggest an Edit or Addition)According to Wikipedia, Ronald John Fitzgerald Cramer is a professor at the Centrum Wiskunde & Informatica in Amsterdam and the University of Leiden. He obtained his PhD from the University of Amsterdam in 1997. Prior to returning to the Netherlands he was at the University of Aarhus.
Ronald Cramer's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack (1998) (1510)
- Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols (1994) (1210)
- Advances in Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005, Proceedings (2005) (1004)
- A secure and optimally efficient multi-authority election scheme (1997) (983)
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack (2003) (953)
- Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption (2001) (818)
- Multiparty Computation from Threshold Homomorphic Encryption (2000) (609)
- General Secure Multi-party Computation from any Linear Secret-Sharing Scheme (2000) (511)
- Signature schemes based on the strong RSA assumption (2000) (429)
- Multi-Autority Secret-Ballot Elections with Linear Work (1996) (407)
- Secure Multiparty Computation and Secret Sharing (2015) (365)
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors (2008) (273)
- Linear Zero-Knowledgde. A Note on Efficient Zero-Knowledge Proofs and Arguments (1996) (244)
- Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation (2005) (231)
- Efficient Multiparty Computations Secure Against an Adaptive Adversary (1999) (231)
- Modular Design of Secure yet Practical Cryptographic Protocols (1997) (213)
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings (2016) (187)
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields (2006) (170)
- Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments (1997) (162)
- Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free? (1998) (160)
- Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions (2000) (152)
- The ESPRIT Project CAFE - High Security Digital Payment Systems (1994) (132)
- Secure Computation from Random Error Correcting Codes (2007) (130)
- Short Stickelberger Class Relations and Application to Ideal-SVP (2016) (118)
- Multiparty Computation, an Introduction (2005) (115)
- Efficient Multi-party Computation over Rings (2003) (99)
- New Generation of Secure and Practical RSA-Based Signatures (1996) (95)
- Public Key Cryptography - PKC 2008, 11th International Workshop on Practice and Theory in Public-Key Cryptography, Barcelona, Spain, March 9-12, 2008. Proceedings (2008) (94)
- Secure Distributed Linear Algebra in a Constant Number of Rounds (2001) (93)
- Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups (2002) (91)
- On the Amortized Complexity of Zero-Knowledge Protocols (2009) (89)
- SPDℤ 2 k : Efficient MPC mod 2 k for Dishonest Majority. (2018) (84)
- Improved Privacy in Wallets with Observers (Extended Abstract) (1994) (83)
- Zero-Knowledge Proofs for Finite Field Arithmetic or: Can Zero-Knowledge be for Free? (1997) (81)
- Bounded CCA2-Secure Encryption (2007) (79)
- On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes (2005) (78)
- SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority (2018) (74)
- Introduction to Secure Computation (1998) (72)
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field (2009) (65)
- On the complexity of verifiable secret sharing and multiparty computation (2000) (61)
- On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase (2001) (61)
- Signature schemes based on the strong RSA assumption (1999) (61)
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions (2015) (59)
- Asymptotically Optimal Two-Round Perfectly Secure Message Transmission (2006) (59)
- Secure Signature Schemes based on Interactive Protocols (1994) (53)
- Squares of Random Linear Codes (2014) (49)
- The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing (2011) (39)
- Amortized Complexity of Information-Theoretically Secure MPC Revisited (2018) (38)
- Efficient Multiparty Computations with Dishonest Minority (1998) (35)
- Secure Multiparty Computation and Secret Sharing: Preliminaries (2015) (35)
- Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves (2008) (34)
- SPDZ2k: Efficient MPC mod 2 for Dishonest Majority (2022) (34)
- Contemporary Cryptology (Advanced Courses in Mathematics - CRM Barcelona) (2005) (32)
- Bounds on the Threshold Gap in Secret Sharing and its Applications (2013) (31)
- Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model (2015) (29)
- Torsion Limits and Riemann-Roch Systems for Function Fields and Applications (2012) (28)
- A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra (2007) (27)
- Efficient Information-Theoretic Secure Multiparty Computation over ℤ/pk ℤ via Galois Rings (2019) (27)
- Compressed Σ-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics (2020) (25)
- Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation (2004) (25)
- Contemporary cryptology (2005) (24)
- Compressing Proofs of k-Out-Of-n Partial Knowledge (2020) (23)
- Span Programs and General Secure Multi-Party Computation (1997) (23)
- Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack (2016) (23)
- A Compressed Σ-Protocol Theory for Lattices (2021) (22)
- Algebraic manipulation detection codes (2013) (20)
- A Framework for Secure Computations With Two Non-Colluding Servers and Multiple Clients, Applied to Recommendations (2015) (20)
- Atomic Secure Multi-party Multiplication with Low Communication (2007) (18)
- Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields (2005) (18)
- Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields (2012) (18)
- Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments (2002) (17)
- A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems (2010) (16)
- The arithmetic codex (2012) (15)
- Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation (1997) (15)
- The Arithmetic Codex: Theory and Applications (2011) (12)
- Compressed $\varSigma $-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics (2020) (11)
- Theory of cryptography : 9th theory of cryptography conference, TCC 2012, Taormina, Sicily, Italy, March 19-21, 2012 : proceedings (2012) (11)
- Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time (2021) (10)
- Compressed $\varSigma $-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures (2021) (10)
- On monotone function closure of perfect and statistical zero-knowledge (1996) (9)
- DDH-like Assumptions Based on Extension Rings (2012) (9)
- Asymptotically-Good Arithmetic Secret Sharing over Z/pZ with Strong Multiplication and Its Applications to E cient MPC (2021) (9)
- Asymptotically-Good Arithmetic Secret Sharing over Z/(p^\ell Z) with Strong Multiplication and Its Applications to Efficient MPC (2019) (8)
- Efficient and Provable Security Amplifications (1996) (8)
- Efficient Information-Theoretic Secure Multiparty Computation over Z /p k Z via Galois Rings (2019) (8)
- Improved single-round secure multiplication using regenerating codes (2021) (7)
- Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z (2020) (6)
- A Tricky Path to Quantum-Safe Encryption - Quanta Magazine (2015) (5)
- Vector Commitments over Rings and Compressed Σ-Protocols (2022) (5)
- Compressed Sigma-Protocols for Bilinear Circuits and Applications to Logarithmic-Sized Transparent Threshold Signature Schemes (2020) (5)
- An Improvement on the Hasse-Weil Bound and applications to Character Sums, Cryptography and Coding (2015) (4)
- A note on short invertible ring elements and applications to cyclotomic and trinomials number fields (2019) (4)
- A Compressed $\varSigma $-Protocol Theory for Lattices (2021) (4)
- Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques (2005) (4)
- A Note on Bounded Chosen Ciphertext Security from Black-box Semantical Security (2006) (3)
- On Multi-Point Local Decoding of Reed-Muller Codes (2016) (3)
- BOOKS THAT NEED REVIEWERS FOR THE SIGACT NEWS COLUMN Algorithms 1. Distributed Systems: An algorithmic approach (second edition), by Ghosh 2. Tractability: Practical approach to Hard Problems, Edited by Bordeaux, (2012) (3)
- Chosen-ciphertext Secure Encryption from Hard Algebraic Set Systems (2009) (3)
- Compressed Σ-Protocols for Bilinear Group Arithmetic Circuits and Applications (2021) (3)
- Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model (2016) (3)
- On Secret Sharing with Nonlinear Product Reconstruction (2013) (3)
- Zero Knowledge Protocols and Multiparty Computation (2011) (2)
- On shared randomness and the size of secure signatures (1995) (2)
- Optimal Algebraic Manipulation Detection Codes (2014) (2)
- Vector Commitments over Rings and Compressed $\varSigma $-Protocols (2022) (2)
- On Electronic Payment Systems (2009) (2)
- New Approach to Privacy-Preserving Clinical Decision Support Systems for HIV Treatment (2018) (2)
- The Mathematical Theory of Information , and Applications ( Version 2 . 0 ) (2011) (2)
- Share conversion , pseudorandom secret-sharing and applications to secure distributed computing (2005) (2)
- Theory of Cryptography (2012) (2)
- Bounds on the Threshold Gap in Secret Sharing over Small Fields (2012) (2)
- Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $ (2020) (2)
- Public Key Cryptography (2008) (1)
- On the Amortized Complexity of Zero-Knowledge Protocols (2013) (1)
- On Monotone Function Closure of Statistical Zero-Knowledge (1996) (1)
- Primitive Sets over Number Fields and Absolutely Optimal Black-Box Secret Sharing (2005) (1)
- Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes (2020) (1)
- Digital payment systems in the ESPRIT project CAFE (1994) (1)
- SPD Z 2 k : Efficient MPC mod 2 k for Dishonest Majority To appear at CRYPTO 2018 (2018) (1)
- On the Complexity of Arithmetic Secret Sharing (2019) (1)
- Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex (2016) (1)
- Cryptology (MasterMath,DIAMANT) (2012) (0)
- Advances in Cryptology - EUROCRYPT 2005: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, ... (Lecture Notes in Computer Science) (2005) (0)
- SPD Z 2 k : Efficient MPC mod 2 k for Dishonest Majority (2018) (0)
- Applications of MPC (2015) (0)
- Title On Secret Sharing with Nonlinear Product Reconstruction (2018) (0)
- Information-Theoretic Robust MPC Protocols (2015) (0)
- Cryptographic MPC Protocols (2015) (0)
- Secure Computation over Integers Modulo Powers of Two (2021) (0)
- Control and Cybernetics Contemporary Cryptology (2008) (0)
- 07381 Executive Summary - Cryptography (2007) (0)
- Proceedings of the 9th international conference on Theory of Cryptography (2012) (0)
- Coding-Theoretic Aspects of Arithmetic Codices (2012) (0)
- Collection Cryptography Dagstuhl Seminar (2008) (0)
- Cryptographic Security by Swamping Adversaries with Quantum Information (2005) (0)
- Some Techniques for Efficiency Improvements (2015) (0)
- Asymptotically-Good Arithmetic Secret Sharing over $\mathbb {Z}/p^{\ell }\mathbb {Z}$ with Strong Multiplication and Its Applications to Efficient MPC (2021) (0)
- I T ] 7 A pr 2 01 6 On Multi-Point Local Decoding of Reed-Muller Codes (2016) (0)
- 07381 Abstracts Collection -- Cryptography (2007) (0)
- Short-Course on Cryptology (2007) (0)
- MPC Protocols with Passive Security (2015) (0)
- Compressed E-protocol Theory and Practical Applications to Plug & Play Algorithms (2020) (0)
- RAPPORT Efficient and provable security amplifications (1995) (0)
- Algebraic manipulation detection codes (2013) (0)
- Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography (2008) (0)
- Modular design of practical and provably secure cryptographic protocols (1997) (0)
- On powers of codes (2014) (0)
- MPC from General Linear Secret-Sharing Schemes (2015) (0)
- Cryptography from quantum uncertainty in the presence of quantum side information (2008) (0)
This paper list is powered by the following services:
Other Resources About Ronald Cramer
What Schools Are Affiliated With Ronald Cramer?
Ronald Cramer is affiliated with the following schools:
