Ronald Cramer
Artificial Intelligence · 1994–2018
A researcher in the Science corpus: 14 papers; trusts 29 researchers and is trusted by 112 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 61 citations into it; #3,262 of 36,961 by trust here, #6,030 by citations
- Computational Theory and Mathematics — 40 citations into it; #1,187 of 12,489 by trust here, #1,061 by citations
- Computer Networks and Communications — 38 citations into it
- Information Systems — 30 citations into it
- Privacy & Security — 25 citations into it; #133 of 710 by trust here, #243 by citations
- Discrete Mathematics and Combinatorics — 14 citations into it
- Information Theory — 8 citations into it
- Computer Vision and Pattern Recognition — 5 citations into it
Whom Ronald Cramer trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Victor Shoup
- Ran Canetti
- Ivan Bjerre Damgård
- Mihir Bellare
- Pascal Paillier
- Shafi Goldwasser
- Marcel Keller
- Brent Waters
- Dan Boneh
- Phillip Rogaway
Who trusts Ronald Cramer overall
- Jan Camenisch
- Victor Shoup
- Eike Kiltz
- Dan Boneh
- Moni Naor
- Dennis Hofheinz
- Octavian Catrina
- Ivan Bjerre Damgård
- Markus Jakobsson
- Yuliang Zheng
Papers from Ronald Cramer's perspective
Ordered by how strongly the researchers Ronald Cramer trusts endorse each paper. Same corpus, a different order for every researcher.
- New Directions in Cryptography
- Random oracles are practical: a paradigm for designing efficient protocols
- Probabilistic Encryption
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A method for obtaining digital signatures and public-key cryptosystems
- Efficient Identity-Based Encryption Without Random Oracles (International Conference on the Theory and Application of Cryptographic Techniques)
- Fair exchange with a semi-trusted third party (extended abstract)
- How to share a secret
- Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption (International Conference on the Theory and Application of Cryptographic Techniques)
Their papers
- Multiparty Computation from Threshold Homomorphic Encryption (2000) — 669 citations
- Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation (2005) — 312 citations
- Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments (2002) — 23 citations
- General Secure Multi-party Computation from any Linear Secret-Sharing Scheme (2000) — 599 citations
- SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority (2018) — 192 citations
- Secure Multiparty Computation and Secret Sharing (2015) — 530 citations
- SPD Z 2 k : Efficient MPC mod 2 k for Dishonest Majority (2018)
- SPD Z 2 k : Efficient MPC mod 2 k for Dishonest Majority To appear at CRYPTO 2018 (2018)
- 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) — 1,008 citations
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack (2003) — 1,022 citations
- Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption (2001) — 872 citations
- Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free? (1998)
- A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack (1998)
- Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols (1994)