Search the dblp DataBase
Ronald Cramer :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Ronald Cramer Introduction to Secure Computation. [Citation Graph (0, 0)][DBLP ] Lectures on Data Security, 1998, pp:16-62 [Conf ] Masayuki Abe , Ronald Cramer , Serge Fehr Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments. [Citation Graph (0, 0)][DBLP ] ASIACRYPT, 2002, pp:206-223 [Conf ] Ronald Cramer , Victor Shoup Signature Schemes Based on the Strong RSA Assumption. [Citation Graph (0, 0)][DBLP ] ACM Conference on Computer and Communications Security, 1999, pp:46-51 [Conf ] Ronald Cramer , Ivan Damgård Secure Distributed Linear Algebra in a Constant Number of Rounds. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2001, pp:119-136 [Conf ] Ronald Cramer , Ivan Damgård Secure Signature Schemes based on Interactive Protocols. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1995, pp:297-310 [Conf ] Ronald Cramer , Ivan Damgård Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free? [Citation Graph (0, 0)][DBLP ] CRYPTO, 1998, pp:424-441 [Conf ] Ronald Cramer , Ivan Damgård , Serge Fehr On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2001, pp:503-523 [Conf ] Ronald Cramer , Vanesa Daza , Ignacio Gracia , Jorge Jiménez Urroz , Gregor Leander , Jaume Martí-Farré , Carles Padró On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2005, pp:327-343 [Conf ] Ronald Cramer , Ivan Damgård , Berry Schoenmakers Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1994, pp:174-187 [Conf ] Ronald Cramer , Serge Fehr Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2002, pp:272-287 [Conf ] Ronald Cramer , Serge Fehr , Martijn Stam Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2005, pp:344-360 [Conf ] Ronald Cramer , Victor Shoup A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1998, pp:13-25 [Conf ] Ronald Cramer , Ivan Damgård New Generation of Secure and Practical RSA-Based Signatures. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1996, pp:173-185 [Conf ] Saurabh Agarwal , Ronald Cramer , Robbert de Haan Asymptotically Optimal Two-Round Perfectly Secure Message Transmission. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:394-408 [Conf ] Hao Chen , Ronald Cramer Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2006, pp:521-536 [Conf ] Jean-Paul Boly , Antoon Bosselaers , Ronald Cramer , Rolf Michelsen , Stig Fr. Mjølsnes , Frank Muller , Torben P. Pedersen , Birgit Pfitzmann , Peter de Rooij , Berry Schoenmakers , Matthias Schunter , Luc Vallée , Michael Waidner The ESPRIT Project CAFE - High Security Digital Payment Systems. [Citation Graph (0, 0)][DBLP ] ESORICS, 1994, pp:217-230 [Conf ] Ronald Cramer , Ivan Damgård Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1997, pp:75-87 [Conf ] Ronald Cramer , Ivan Damgård , Stefan Dziembowski , Martin Hirt , Tal Rabin Efficient Multiparty Computations Secure Against an Adaptive Adversary. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1999, pp:311-326 [Conf ] Ronald Cramer , Ivan Damgård , Ueli M. Maurer General Secure Multi-party Computation from any Linear Secret-Sharing Scheme. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 2000, pp:316-334 [Conf ] Ronald Cramer , Ivan Damgård , Jesper Buus Nielsen Multiparty Computation from Threshold Homomorphic Encryption. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 2001, pp:280-299 [Conf ] Ronald Cramer , Serge Fehr , Yuval Ishai , Eyal Kushilevitz Efficient Multi-party Computation over Rings. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 2003, pp:596-613 [Conf ] Ronald Cramer , Matthew K. Franklin , Berry Schoenmakers , Moti Yung Multi-Autority Secret-Ballot Elections with Linear Work. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1996, pp:72-83 [Conf ] Ronald Cramer , Rosario Gennaro , Berry Schoenmakers A Secure and Optimally Efficient Multi-Authority Election Scheme. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1997, pp:103-118 [Conf ] Ronald Cramer , Torben P. Pedersen Improved Privacy in Wallets with Observers (Extended Abstract). [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1993, pp:329-343 [Conf ] Ronald Cramer , Victor Shoup Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 2002, pp:45-64 [Conf ] Ronald Cramer , Ivan Damgård , Philip D. MacKenzie Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions. [Citation Graph (0, 0)][DBLP ] Public Key Cryptography, 2000, pp:354-373 [Conf ] Ronald Cramer , Ivan Damgård , Torben P. Pedersen Efficient and Provable Security Amplifications. [Citation Graph (0, 0)][DBLP ] Security Protocols Workshop, 1996, pp:101-109 [Conf ] Ronald Cramer , Ivan Damgård Linear Zero-Knowledge - A Note on Efficient Zero-Knowledge Proofs and Arguments. [Citation Graph (0, 0)][DBLP ] STOC, 1997, pp:436-445 [Conf ] Ronald Cramer , Ivan Damgård , Stefan Dziembowski On the complexity of verifiable secret sharing and multiparty computation. [Citation Graph (0, 0)][DBLP ] STOC, 2000, pp:325-334 [Conf ] Ronald Cramer , Ivan Damgård Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation. [Citation Graph (0, 0)][DBLP ] TCC, 2004, pp:223-237 [Conf ] Ronald Cramer , Ivan Damgård , Yuval Ishai Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation. [Citation Graph (0, 0)][DBLP ] TCC, 2005, pp:342-362 [Conf ] Ronald Cramer , Victor Shoup Universal Hash Proofs and and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:072, pp:- [Journal ] Ronald Cramer , Victor Shoup Signature schemes based on the strong RSA assumption. [Citation Graph (0, 0)][DBLP ] ACM Trans. Inf. Syst. Secur., 2000, v:3, n:3, pp:161-185 [Journal ] Ronald Cramer , Goichiro Hanaoka , Dennis Hofheinz , Hideki Imai , Eike Kiltz , Rafael Pass , Abhi Shelat , Vinod Vaikuntanathan Bounded CCA2-Secure Encryption. [Citation Graph (0, 0)][DBLP ] ASIACRYPT, 2007, pp:502-518 [Conf ] Ronald Cramer , Eike Kiltz , Carles Padró A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2007, pp:613-630 [Conf ] Hao Chen , Ronald Cramer , Shafi Goldwasser , Robbert de Haan , Vinod Vaikuntanathan Secure Computation from Random Error Correcting Codes. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 2007, pp:291-310 [Conf ] Ronald Cramer , Ivan Damgård , Robbert de Haan Atomic Secure Multi-party Multiplication with Low Communication. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 2007, pp:329-346 [Conf ] Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field. [Citation Graph (, )][DBLP ] On the Amortized Complexity of Zero-Knowledge Protocols. [Citation Graph (, )][DBLP ] 07381 Executive Summary - Cryptography. [Citation Graph (, )][DBLP ] 07381 Abstracts Collection -- Cryptography. [Citation Graph (, )][DBLP ] Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves. [Citation Graph (, )][DBLP ] Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors. [Citation Graph (, )][DBLP ] A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.308secs