 | 2012 |
|---|
| 66 |       | Ronald Cramer:
Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Taormina, Sicily, Italy, March 19-21, 2012. Proceedings
Springer 2012 |
| 65 | | Ronald Cramer,
Ivan Damgård,
Eike Kiltz,
Sarah Zakarias,
Angela Zottarel:
DDH-Like Assumptions Based on Extension Rings.
Public Key Cryptography 2012: 644-661 |
| 2011 |
|---|
| 64 | | Ignacio Cascudo Pueyo,
Ronald Cramer,
Chaoping Xing:
The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing.
CRYPTO 2011: 685-705 |
| 63 | | Ronald Cramer:
The Arithmetic Codex: Theory and Applications.
EUROCRYPT 2011: 1 |
| 62 | | Ronald Cramer,
Ivan Damgård,
Eike Kiltz,
Sarah Zakarias,
Angela Zottarel:
DDH-like Assumptions Based on Extension Rings.
IACR Cryptology ePrint Archive 2011: 280 (2011) |
| 61 | | Ronald Cramer,
Ivan Damgård,
Valerio Pastro:
On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations.
IACR Cryptology ePrint Archive 2011: 301 (2011) |
| 2010 |
|---|
| 60 | | Ronald Cramer,
Dennis Hofheinz,
Eike Kiltz:
A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems.
TCC 2010: 146-164 |
| 2009 |
|---|
| 59 | | Ronald Cramer,
Ivan Damgård:
On the Amortized Complexity of Zero-Knowledge Protocols.
CRYPTO 2009: 177-191 |
| 58 | | Ignacio Cascudo Pueyo,
Hao Chen,
Ronald Cramer,
Chaoping Xing:
Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field.
CRYPTO 2009: 466-486 |
| 57 | | Ronald Cramer,
Dennis Hofheinz,
Eike Kiltz:
Chosen-ciphertext Secure Encryption from Hard Algebraic Set Systems.
IACR Cryptology ePrint Archive 2009: 142 (2009) |
| 2008 |
|---|
| 56 |  | Johannes Blömer,
Dan Boneh,
Ronald Cramer,
Ueli M. Maurer:
Cryptography, 16.09. - 21.09.2007
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 |
| 55 | | Ronald Cramer:
Public Key Cryptography - PKC 2008, 11th International Workshop on Practice and Theory in Public-Key Cryptography, Barcelona, Spain, March 9-12, 2008. Proceedings
Springer 2008 |
| 54 | | Hao Chen,
Ronald Cramer,
Robbert de Haan,
Ignacio Cascudo Pueyo:
Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves.
EUROCRYPT 2008: 451-470 |
| 53 | | Ronald Cramer,
Yevgeniy Dodis,
Serge Fehr,
Carles Padró,
Daniel Wichs:
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors.
EUROCRYPT 2008: 471-488 |
| 52 | | Ronald Cramer,
Yevgeniy Dodis,
Serge Fehr,
Carles Padró,
Daniel Wichs:
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors.
IACR Cryptology ePrint Archive 2008: 30 (2008) |
| 51 | | Ronald Cramer,
Vanesa Daza,
Ignacio Gracia,
Jorge Jiménez Urroz,
Gregor Leander,
Jaume Martí-Farré,
Carles Padró:
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes.
IEEE Transactions on Information Theory 54(6): 2644-2657 (2008) |
| 2007 |
|---|
| 50 | | Ronald Cramer,
Goichiro Hanaoka,
Dennis Hofheinz,
Hideki Imai,
Eike Kiltz,
Rafael Pass,
Abhi Shelat,
Vinod Vaikuntanathan:
Bounded CCA2-Secure Encryption.
ASIACRYPT 2007: 502-518 |
| 49 | | Ronald Cramer,
Eike Kiltz,
Carles Padró:
A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra.
CRYPTO 2007: 613-630 |
| 48 | | Johannes Blömer,
Dan Boneh,
Ronald Cramer,
Ueli M. Maurer:
07381 Abstracts Collection -- Cryptography.
Cryptography 2007 |
| 47 | | Johannes Blömer,
Dan Boneh,
Ronald Cramer,
Ueli M. Maurer:
07381 Executive Summary - Cryptography.
Cryptography 2007 |
| 46 | | Hao Chen,
Ronald Cramer,
Shafi Goldwasser,
Robbert de Haan,
Vinod Vaikuntanathan:
Secure Computation from Random Error Correcting Codes.
EUROCRYPT 2007: 291-310 |
| 45 | | Ronald Cramer,
Ivan Damgård,
Robbert de Haan:
Atomic Secure Multi-party Multiplication with Low Communication.
EUROCRYPT 2007: 329-346 |
| 2006 |
|---|
| 44 | | Saurabh Agarwal,
Ronald Cramer,
Robbert de Haan:
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission.
CRYPTO 2006: 394-408 |
| 43 | | Hao Chen,
Ronald Cramer:
Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields.
CRYPTO 2006: 521-536 |
| 42 | | Ronald Cramer,
Dennis Hofheinz,
Eike Kiltz:
A Note on Bounded Chosen Ciphertext Security from Black-box Semantical Security.
IACR Cryptology ePrint Archive 2006: 391 (2006) |
| 2005 |
|---|
| 41 | | Ronald Cramer:
Advances in Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005, Proceedings
Springer 2005 |
| 40 | | 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.
CRYPTO 2005: 327-343 |
| 39 | | Ronald Cramer,
Serge Fehr,
Martijn Stam:
Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields.
CRYPTO 2005: 344-360 |
| 38 | | Ronald Cramer,
Ivan Damgård,
Yuval Ishai:
Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation.
TCC 2005: 342-362 |
| 2004 |
|---|
| 37 | | Ronald Cramer,
Ivan Damgård:
Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation.
TCC 2004: 223-237 |
| 36 | | 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.
IACR Cryptology ePrint Archive 2004: 245 (2004) |
| 2003 |
|---|
| 35 | | Ronald Cramer,
Serge Fehr,
Yuval Ishai,
Eyal Kushilevitz:
Efficient Multi-party Computation over Rings.
EUROCRYPT 2003: 596-613 |
| 34 | | Ronald Cramer,
Serge Fehr,
Yuval Ishai,
Eyal Kushilevitz:
Efficient Multi-Party Computation over Rings.
IACR Cryptology ePrint Archive 2003: 30 (2003) |
| 2002 |
|---|
| 33 | | Masayuki Abe,
Ronald Cramer,
Serge Fehr:
Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments.
ASIACRYPT 2002: 206-223 |
| 32 | | Ronald Cramer,
Serge Fehr:
Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups.
CRYPTO 2002: 272-287 |
| 31 | | Ronald Cramer,
Victor Shoup:
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption.
EUROCRYPT 2002: 45-64 |
| 30 | | Ronald Cramer,
Serge Fehr:
Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups.
IACR Cryptology ePrint Archive 2002: 36 (2002) |
| 2001 |
|---|
| 29 | | Ronald Cramer,
Ivan Damgård:
Secure Distributed Linear Algebra in a Constant Number of Rounds.
CRYPTO 2001: 119-136 |
| 28 | | Ronald Cramer,
Ivan Damgård,
Serge Fehr:
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase.
CRYPTO 2001: 503-523 |
| 27 | | Ronald Cramer,
Ivan Damgård,
Jesper Buus Nielsen:
Multiparty Computation from Threshold Homomorphic Encryption.
EUROCRYPT 2001: 280-299 |
| 26 | | Ronald Cramer,
Victor Shoup:
Universal Hash Proofs and and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
Electronic Colloquium on Computational Complexity (ECCC) 8(072): (2001) |
| 25 | | Ronald Cramer,
Victor Shoup:
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack.
IACR Cryptology ePrint Archive 2001: 108 (2001) |
| 24 | | Ronald Cramer,
Victor Shoup:
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption.
IACR Cryptology ePrint Archive 2001: 85 (2001) |
| 2000 |
|---|
| 23 | | Ronald Cramer,
Ivan Damgård,
Ueli M. Maurer:
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme.
EUROCRYPT 2000: 316-334 |
| 22 | | Ronald Cramer,
Ivan Damgård,
Philip D. MacKenzie:
Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions.
Public Key Cryptography 2000: 354-373 |
| 21 | | Ronald Cramer,
Ivan Damgård,
Stefan Dziembowski:
On the complexity of verifiable secret sharing and multiparty computation.
STOC 2000: 325-334 |
| 20 | | Ronald Cramer,
Victor Shoup:
Signature schemes based on the strong RSA assumption.
ACM Trans. Inf. Syst. Secur. 3(3): 161-185 (2000) |
| 19 | | Ronald Cramer,
Ivan Damgård,
Ueli Maurer:
General Secure Multi-Party Computation from any Linear Secret Sharing Scheme.
IACR Cryptology ePrint Archive 2000: 37 (2000) |
| 18 | | Ronald Cramer,
Ivan Damgård,
Stefan Dziembowski:
On the Complexity of Verifiable Secret Sharing and Multi-Party Computation.
IACR Cryptology ePrint Archive 2000: 38 (2000) |
| 17 | | Ronald Cramer,
Ivan Damgård,
Philip D. MacKenzie:
Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions.
IACR Cryptology ePrint Archive 2000: 45 (2000) |
| 16 | | Ronald Cramer,
Ivan Damgård,
Jesper Buus Nielsen:
Multiparty Computation from Threshold Homomorphic Encryption.
IACR Cryptology ePrint Archive 2000: 55 (2000) |
| 1999 |
|---|
| 15 | | Ronald Cramer,
Victor Shoup:
Signature Schemes Based on the Strong RSA Assumption.
ACM Conference on Computer and Communications Security 1999: 46-51 |
| 14 | | Ronald Cramer,
Ivan Damgård,
Stefan Dziembowski,
Martin Hirt,
Tal Rabin:
Efficient Multiparty Computations Secure Against an Adaptive Adversary.
EUROCRYPT 1999: 311-326 |
| 1998 |
|---|
| 13 | | Ronald Cramer,
Victor Shoup:
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack.
CRYPTO 1998: 13-25 |
| 12 | | Ronald Cramer,
Ivan Damgård:
Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?
CRYPTO 1998: 424-441 |
| 11 | | Ronald Cramer:
Introduction to Secure Computation.
Lectures on Data Security 1998: 16-62 |
| 1997 |
|---|
| 10 | | Ronald Cramer,
Rosario Gennaro,
Berry Schoenmakers:
A Secure and Optimally Efficient Multi-Authority Election Scheme.
EUROCRYPT 1997: 103-118 |
| 9 | | Ronald Cramer,
Ivan Damgård:
Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation.
EUROCRYPT 1997: 75-87 |
| 8 | | Ronald Cramer,
Ivan Damgård:
Linear Zero-Knowledge - A Note on Efficient Zero-Knowledge Proofs and Arguments.
STOC 1997: 436-445 |
| 1996 |
|---|
| 7 | | Ronald Cramer,
Ivan Damgård:
New Generation of Secure and Practical RSA-Based Signatures.
CRYPTO 1996: 173-185 |
| 6 | | Ronald Cramer,
Matthew K. Franklin,
Berry Schoenmakers,
Moti Yung:
Multi-Autority Secret-Ballot Elections with Linear Work.
EUROCRYPT 1996: 72-83 |
| 5 | | Ronald Cramer,
Ivan Damgård,
Torben P. Pedersen:
Efficient and Provable Security Amplifications.
Security Protocols Workshop 1996: 101-109 |
| 1995 |
|---|
| 4 | | Ronald Cramer,
Ivan Damgård:
Secure Signature Schemes based on Interactive Protocols.
CRYPTO 1995: 297-310 |
| 1994 |
|---|
| 3 | | Ronald Cramer,
Ivan Damgård,
Berry Schoenmakers:
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols.
CRYPTO 1994: 174-187 |
| 2 | | 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.
ESORICS 1994: 217-230 |
| 1993 |
|---|
| 1 | | Ronald Cramer,
Torben P. Pedersen:
Improved Privacy in Wallets with Observers (Extended Abstract).
EUROCRYPT 1993: 329-343 |
Data released under the ODC-BY 1.0 license — See also our legal information page