World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
43
Citations
16077
World Ranking
7755
National Ranking
130

Overview

Ronald Cramer is affiliated with Leiden University in the Netherlands. Their research work spans various areas primarily within Computer Science and Engineering, with a significant focus on Artificial Intelligence, Computational Theory and Mathematics, and Information Systems.

Their publications cover topics including Cryptography and Data Security, Complexity and Algorithms in Graphs, Coding theory and cryptography, Cryptography and Residue Arithmetic, graph theory and CDMA systems, Advanced Steganography and Watermarking Techniques, and Advanced Algebra and Logic.

Frequent coauthors collaborating with Ronald Cramer include:

  • Thomas Attema
  • Chaoping Xing
  • Matthieu Rambaud
  • Mark Abspoel
  • Ivan Damgård

The scientist's research has appeared in multiple publication venues such as:

  • Journal of the ACM
  • Journal of Medical Systems
  • Lecture notes in computer science

Notable recent papers by Ronald Cramer include:

  • "Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time" (2021, Journal of the ACM)
  • "New Approach to Privacy-Preserving Clinical Decision Support Systems for HIV Treatment" (2022, Journal of Medical Systems)
  • "On the Complexity of Arithmetic Secret Sharing" (2020, Lecture notes in computer science)

Their academic contributions address fundamental problems in cryptography, computational complexity, and privacy in medical data systems. The emphasis on both theoretical aspects and practical applications illustrates a broad research scope within secure and efficient computation frameworks.

Best Publications

  • A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack

    Ronald Cramer;Victor Shoup

  • Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols

    Ronald Cramer;Ivan Damgård;Berry Schoenmakers

  • A secure and optimally efficient multi-authority election scheme

    Ronald Cramer;Rosario Gennaro;Berry Schoenmakers

  • Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack

    Ronald Cramer;Victor Shoup

  • Multiparty Computation from Threshold Homomorphic Encryption

    Ronald Cramer;Ivan Damgård;Jesper Buus Nielsen

  • General secure multi-party computation from any linear secret-sharing scheme

    Ronald Cramer;Ivan Damgård;Ueli Maurer

  • Signature schemes based on the strong RSA assumption

    Ronald Cramer;Victor Shoup

  • Secure Multiparty Computation and Secret Sharing

    Ronald Cramer;Ivan Bjerre Damgrd;Jesper Buus Nielsen

  • Multi-authority secret-ballot elections with linear work

    Ronald Cramer;Matthew Franklin;Berry Schoenmakers;Moti Yung

  • Secure Multiparty Computation

    Ronald Cramer;Ivan Bjerre Damgård;Jesper Buus Nielsen

  • Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors

    Ronald Cramer;Yevgeniy Dodis;Serge Fehr;Carles Padró

  • Share conversion, pseudorandom secret-sharing and applications to secure computation

    Ronald Cramer;Ivan Damgård;Yuval Ishai

  • The ESPRIT Project CAFE - High Security Digital Payment Systems

    Jean-Paul Boly;Antoon Bosselaers;Ronald Cramer;Rolf Michelsen

  • Efficient multiparty computations secure against an adaptive adversary

    Ronald Cramer;Ivan Damgård;Stefan Dziembowski;Martin Hirt

  • Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments

    Ronald Cramer;Ivan Damgård

  • Signature schemes based on the strong RSA assumption

    Ronald Cramer;Victor Shoup

  • Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?

    Ronald Cramer;Ivan Damgård

  • Recovering Short Generators of Principal Ideals in Cyclotomic Rings

    Ronald Cramer;Léo Ducas;Chris Peikert;Oded Regev

  • Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields

    Unknown

  • Secure Computation from Random Error Correcting Codes

    Hao Chen;Ronald Cramer;Shafi Goldwasser;Robbert Haan

  • Short Stickelberger Class Relations and Application to Ideal-SVP

    Ronald Cramer;Léo Ducas;Benjamin Wesolowski

Frequent Co-Authors

Ivan Damgård
Ivan Damgård Aarhus University
Serge Fehr
Serge Fehr Centrum Wiskunde & Informatica
Jesper Buus Nielsen
Jesper Buus Nielsen Aarhus University
Eike Kiltz
Eike Kiltz Ruhr University Bochum
Gregor Leander
Gregor Leander Ruhr University Bochum
Chris Peikert
Chris Peikert University of Michigan–Ann Arbor
Yevgeniy Dodis
Yevgeniy Dodis New York University
Daniel Wichs
Daniel Wichs Northeastern University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens the door to multiple online degree options that offer increased flexibility and affordability. Many students seek the cheapest online university programs to start their higher education journey without accumulating significant debt.

For those interested in specialized fields, an online engineer degree can lead to high-demand careers in technology, infrastructure, or manufacturing. Professionals looking to advance into leadership positions may consider enrolling in affordable emba programs to build managerial and business skills.

Beyond core tech roles, computer science knowledge is also valuable in other fields. Pursuing a masters in library science online, for example, is ideal for those keen on working with digital information systems and archives.

Whether you’re just starting or aiming to specialize, these pathways provide flexible opportunities to align your career goals with modern industry needs.

Best Scientists Citing Ronald Cramer

Trending Scientists