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

Ronald Cramer, R. Cramer, 2005, EUROCRYPT.

Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields

Ronald Cramer, Serge Fehr, Martijn Stam, 2005, CRYPTO.

A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra

Carles Padró, Ronald Cramer, Eike Kiltz, 2007, CRYPTO.

On Monotone Function Closure of Statistical Zero-Knowledge

Ivan Damgård, Ronald Cramer, R. Cramer, 1996, IACR Cryptol. ePrint Arch..

Some Techniques for Efficiency Improvements

Ivan Damgård, Ronald Cramer, Jesper Buus Nielsen, 2015 .

Multiparty Computation from Threshold Homomorphic Encryption

Ivan Damgård, Ronald Cramer, Jesper Buus Nielsen, 2000, EUROCRYPT.

Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments

Ronald Cramer, Serge Fehr, Masayuki Abe, 2002, ASIACRYPT.

Universal Hash Proofs and and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption

Ronald Cramer, Victor Shoup, 2001, Electron. Colloquium Comput. Complex..

Torsion Limits and Riemann-Roch Systems for Function Fields and Applications

Ignacio Cascudo, Ronald Cramer, Chaoping Xing, 2012, IEEE Transactions on Information Theory.

The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing

Ignacio Cascudo, Ronald Cramer, Chaoping Xing, 2011, CRYPTO.

Chosen-ciphertext Secure Encryption from Hard Algebraic Set Systems

Ronald Cramer, Eike Kiltz, Dennis Hofheinz, 2009, IACR Cryptol. ePrint Arch..

Short-Course on Cryptology

Ronald Cramer, Eike Kiltz, Serge Fehr, 2007 .

The arithmetic codex

Ignacio Cascudo, Ronald Cramer, Chaoping Xing, 2012, 2012 IEEE Information Theory Workshop.

On Multi-Point Local Decoding of Reed-Muller Codes

Ronald Cramer, Chen Yuan, Chaoping Xing, 2016, Electron. Colloquium Comput. Complex..

MPC Protocols with Passive Security

Ivan Damgård, Ronald Cramer, Jesper Buus Nielsen, 2015 .

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $

Ivan Damgård, Ronald Cramer, Chaoping Xing, 2020, ASIACRYPT.

Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field

Ignacio Cascudo, Hao Chen, Ronald Cramer, 2009, CRYPTO.

Efficient Multiparty Computations with Dishonest Minority

Ronald Cramer, Tal Rabin, Stefan Dziembowski, 1998 .

A secure and optimally efficient multi-authority election scheme

Ronald Cramer, Rosario Gennaro, Berry Schoenmakers, 1997, Eur. Trans. Telecommun..

Contemporary cryptology

Giovanni Di Crescenzo, Ivan Damgård, David Pointcheval, 2005, Advanced courses in mathematics : CRM Barcelona.

Bounds on the Threshold Gap in Secret Sharing over Small Fields

Ignacio Cascudo, Ronald Cramer, Chaoping Xing, 2012, IACR Cryptol. ePrint Arch..

Efficient and Provable Security Amplifications

Ivan Damgård, Ronald Cramer, Torben P. Pedersen, 1996, Security Protocols Workshop.

SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority

Ivan Damgård, Ronald Cramer, Chaoping Xing, 2018, IACR Cryptol. ePrint Arch..

Compressed $\varSigma $-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics

Ronald Cramer, Thomas Attema, 2020, CRYPTO.

On powers of codes pdf

Ignacio Cascudo, Ronald Cramer, Gilles Zémor, 2014, IACR Cryptol. ePrint Arch..

Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation

Ivan Damgård, Ronald Cramer, 1997, EUROCRYPT.

The ESPRIT Project CAFE - High Security Digital Payment Systems

Ronald Cramer, Birgit Pfitzmann, Stig Fr. Mjølsnes, 1994, ESORICS.

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

Ivan Damgård, Ronald Cramer, R. Cramer, 1997, STOC '97.

Public Key Cryptography

Ronald Cramer, R. Cramer, 2008 .

Signature schemes based on the strong RSA assumption

Ronald Cramer, Victor Shoup, R. Cramer, 2000, TSEC.

Squares of Random Linear Codes

Ignacio Cascudo, Ronald Cramer, Gilles Zémor, 2014, IEEE Transactions on Information Theory.

Improved Privacy in Wallets with Observers (Extended Abstract)

Ronald Cramer, Torben P. Pedersen, R. Cramer, 1994, EUROCRYPT.

DDH-like Assumptions Based on Extension Rings

Ivan Damgård, Ronald Cramer, Eike Kiltz, 2011, IACR Cryptol. ePrint Arch..

Compressing Proofs of k-Out-Of-n Partial Knowledge

Ronald Cramer, Serge Fehr, Thomas Attema, 2020, IACR Cryptol. ePrint Arch..

Writing Workshop. Focus on Fiction.

Ronald Cramer, R. Cramer, 1992 .

Amortized Complexity of Information-Theoretically Secure MPC Revisited

Ignacio Cascudo, Ronald Cramer, Chen Yuan, 2018, IACR Cryptol. ePrint Arch..

Theory of Cryptography

Ronald Cramer, R. Cramer, 2012, Lecture Notes in Computer Science.

Atomic Secure Multi-party Multiplication with Low Communication

Ivan Damgård, Ronald Cramer, Robbert de Haan, 2007, EUROCRYPT.

Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation

Ivan Damgård, Ronald Cramer, 2004, TCC.

Secure Signature Schemes Based on Interactive Protocols

Ivan Damgård, Ronald Cramer, 1994 .

Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups

Ronald Cramer, Serge Fehr, R. Cramer, 2002, CRYPTO.

Best Practices And Lessons Learned After 10 Years Of Digital Oilfield (DOF) Implementations

Ronald Cramer, Michael Nikolaou, Luigi Alfonso Saputelli, 2013 .

Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols

Ivan Damgård, Ronald Cramer, Berry Schoenmakers, 1994, CRYPTO.

General Secure Multi-party Computation from any Linear Secret-Sharing Scheme

Ueli Maurer, Ivan Damgård, Ronald Cramer, 2000, EUROCRYPT.

Bounds on the Threshold Gap in Secret Sharing and its Applications

Ignacio Cascudo, Ronald Cramer, Chaoping Xing, 2013, IEEE Transactions on Information Theory.

On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations

Ivan Damgård, Ronald Cramer, Valerio Pastro, 2012, ICITS.

Advances in Cryptology - EUROCRYPT 2005: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, ... (Lecture Notes in Computer Science)

Ronald Cramer, R. Cramer, 2005 .

On the complexity of verifiable secret sharing and multiparty computation

Ivan Damgård, Ronald Cramer, Stefan Dziembowski, 2000, STOC '00.

New Generation of Secure and Practical RSA-Based Signatures

Ivan Damgård, Ronald Cramer, R. Cramer, 1996, CRYPTO.

Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes

Ronald Cramer, Chaoping Xing, 2019, IACR Cryptol. ePrint Arch..

Secure Computation from Random Error Correcting Codes

Hao Chen, Ronald Cramer, Vinod Vaikuntanathan, 2007, EUROCRYPT.

Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions

Ivan Damgård, Ronald Cramer, Philip D. MacKenzie, 2000, Public Key Cryptography.

Theory of cryptography : 9th theory of cryptography conference, TCC 2012, Taormina, Sicily, Italy, March 19-21, 2012 : proceedings

Ronald Cramer, 2012 .

A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems

Ronald Cramer, Eike Kiltz, Dennis Hofheinz, 2010, TCC.

New Approach to Privacy-Preserving Clinical Decision Support Systems for HIV Treatment pdf

Peter M. A. Sloot, Ronald Cramer, Thijs Veugen, 2018, Journal of Medical Systems.

On the Amortized Complexity of Zero-Knowledge Protocols

Ivan Damgård, Ronald Cramer, 2009, CRYPTO.

Compressed Sigma-Protocols for Bilinear Circuits and Applications to Logarithmic-Sized Transparent Threshold Signature Schemes

Ronald Cramer, Matthieu Rambaud, Thomas Attema, 2020, IACR Cryptol. ePrint Arch..

Short Stickelberger Class Relations and Application to Ideal-SVP

Ronald Cramer, Léo Ducas, Benjamin Wesolowski, 2016, EUROCRYPT.

On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes

Carles Padró, Jorge Jiménez Urroz, Ronald Cramer, 2008, IEEE Trans. Inf. Theory.

Optimal Algebraic Manipulation Detection Codes

Carles Padró, Ronald Cramer, Chaoping Xing, 2014, IACR Cryptol. ePrint Arch..

Compressed Σ-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics

Ronald Cramer, Thomas Attema, R. Cramer, 2020, IACR Cryptol. ePrint Arch..

A secure and optimally efficient multi-authority election scheme

Ronald Cramer, Rosario Gennaro, Berry Schoenmakers, 1997, Eur. Trans. Telecommun..

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

Ivan Damgård, Ronald Cramer, R. Cramer, 1997 .

Asymptotically-Good Arithmetic Secret Sharing over Z/(p^\ell Z) with Strong Multiplication and Its Applications to Efficient MPC

Ronald Cramer, Chaoping Xing, Matthieu Rambaud, 2019, IACR Cryptol. ePrint Arch..

MPC from General Linear Secret-Sharing Schemes

Ivan Damgård, Ronald Cramer, Jesper Buus Nielsen, 2015 .

On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes

Carles Padró, Jorge Jiménez Urroz, Ronald Cramer, 2005, IEEE Transactions on Information Theory.

The Arithmetic Codex: Theory and Applications

Ronald Cramer, 2011, EUROCRYPT.

Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors

Carles Padró, Ronald Cramer, Serge Fehr, 2008, EUROCRYPT.

Introduction to Secure Computation

Ronald Cramer, R. Cramer, 1998, Lectures on Data Security.

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

Hao Chen, Ronald Cramer, R. Cramer, 2006, CRYPTO.

07381 Abstracts Collection -- Cryptography

Ueli Maurer, Dan Boneh, Ronald Cramer, 2007, Cryptography.

Asymptotically Optimal Two-Round Perfectly Secure Message Transmission

Ronald Cramer, Saurabh Agarwal, Robbert de Haan, 2006, CRYPTO.

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

Ivan Damgård, Ronald Cramer, R. Cramer, 1998, CRYPTO.

Information-Theoretic Robust MPC Protocols

Ivan Damgård, Ronald Cramer, Jesper Buus Nielsen, 2015 .

Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques

Ronald Cramer, R. Cramer, 2005 .

Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields

Ignacio Cascudo, An Yang, Ronald Cramer, 2012, IEEE Transactions on Information Theory.

Modular Design of Secure yet Practical Cryptographic Protocols

Ronald Cramer, R. Cramer, 1997 .

Public Key Cryptography - PKC 2008, 11th International Workshop on Practice and Theory in Public-Key Cryptography, Barcelona, Spain, March 9-12, 2008. Proceedings

Ronald Cramer, R. Cramer, 2008, Public Key Cryptography.

Secure Multiparty Computation and Secret Sharing

Ivan Damgård, Ronald Cramer, Jesper Buus Nielsen, 2015 .

On the Complexity of Arithmetic Secret Sharing

Ronald Cramer, Chaoping Xing, Chen Yuan, 2019, IACR Cryptol. ePrint Arch..

A note on short invertible ring elements and applications to cyclotomic and trinomials number fields

Ronald Cramer, Chaoping Xing, Thomas Attema, 2019, IACR Cryptol. ePrint Arch..

An Improvement on the Hasse-Weil Bound and applications to Character Sums, Cryptography and Coding pdf

Ronald Cramer, Chaoping Xing, R. Cramer, 2015, ArXiv.

Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model

Ivan Damgård, Ronald Cramer, Nico Döttling, 2017, ICITS.

On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase

Ivan Damgård, Ronald Cramer, Serge Fehr, 2001, CRYPTO.

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

Ronald Cramer, Victor Shoup, R. Cramer, 2003, SIAM J. Comput..

Recovering Short Generators of Principal Ideals in Cyclotomic Rings

Ronald Cramer, Léo Ducas, Chris Peikert, 2016, EUROCRYPT.

Efficient Information-Theoretic Secure Multiparty Computation over ℤ/pk ℤ via Galois Rings

Ronald Cramer, Chen Yuan, Daniel Escudero, 2019, IACR Cryptol. ePrint Arch..

Cryptographic MPC Protocols

Ivan Damgård, Ronald Cramer, Jesper Buus Nielsen, 2015 .

On the Amortized Complexity of Zero-Knowledge Protocols

Marcel Keller, Ivan Damgård, Ronald Cramer, 2009, Journal of Cryptology.

On Secret Sharing with Nonlinear Product Reconstruction

Ignacio Cascudo, Carles Padró, Ronald Cramer, 2013, SIAM J. Discret. Math..

Cryptographic Security by Swamping Adversaries with Quantum Information

Ronald Cramer, Serge Fehr, R. Cramer, 2005 .

Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex

Ronald Cramer, Chaoping Xing, Chen Yuan, 2020, IEEE Transactions on Information Theory.

Efficient Multiparty Computations Secure Against an Adaptive Adversary

Ivan Damgård, Ronald Cramer, Tal Rabin, 1999, EUROCRYPT.

Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves

Ignacio Cascudo, Hao Chen, Ronald Cramer, 2008, EUROCRYPT.

Signature schemes based on the strong RSA assumption

Ronald Cramer, Victor Shoup, R. Cramer, 1999, CCS '99.

Secure Signature Schemes Based on Interactive Protocols See Back Inner Page for a List of Recent Publications in the Brics Report Series. Copies May Be Obtained by Contacting: Secure Signature Schemes Based on Interactive Protocols

Ivan Damgård, Ronald Cramer, R. Cramer, 1995 .

A Framework for Secure Computations With Two Non-Colluding Servers and Multiple Clients, Applied to Recommendations

Ronald Cramer, Thijs Veugen, Frank Muller, 2015, IEEE Transactions on Information Forensics and Security.

Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation

Yuval Ishai, Ivan Damgård, Ronald Cramer, 2005, TCC.

A Note on Bounded Chosen Ciphertext Security from Black-box Semantical Security

Ronald Cramer, Eike Kiltz, Dennis Hofheinz, 2006, IACR Cryptol. ePrint Arch..

Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack

Ivan Damgård, Ronald Cramer, Chaoping Xing, 2016, EUROCRYPT.

Brunei Shell Petroleum Champion Field Gas-lift Optimization Project - FieldWare Production Universe Implementation in a Brown Field

Michael J. Dolan, Ronald Cramer, Frank de Boer, 2008 .

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

Ronald Cramer, Victor Shoup, R. Cramer, 1998, CRYPTO.

Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption

Ronald Cramer, Victor Shoup, R. Cramer, 2001, EUROCRYPT.

Proceedings of the 9th international conference on Theory of Cryptography

Ronald Cramer, R. Cramer, 2012 .

07381 Executive Summary - Cryptography

Ueli Maurer, Dan Boneh, Ronald Cramer, 2007, Cryptography.

Bounded CCA2-Secure Encryption

Abhi Shelat, Hideki Imai, Ronald Cramer, 2007, ASIACRYPT.

Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model

Carles Padró, Ronald Cramer, Chaoping Xing, 2015, TCC.

Cryptology (MasterMath,DIAMANT)

Ignacio Cascudo, Ronald Cramer, Marc Stevens, 2012 .

Efficient Multi-party Computation over Rings

Yuval Ishai, Eyal Kushilevitz, Ronald Cramer, 2003, EUROCRYPT.

Secure Distributed Linear Algebra in a Constant Number of Rounds

Ivan Damgård, Ronald Cramer, R. Cramer, 2001, CRYPTO.

Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions

Ivan Damgård, Ronald Cramer, Nico Döttling, 2015, EUROCRYPT.

Multi-Autority Secret-Ballot Elections with Linear Work

Matthew K. Franklin, Moti Yung, Ronald Cramer, 1996, EUROCRYPT.

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z

Ivan Damgård, Ronald Cramer, Chaoping Xing, 2020, IACR Cryptol. ePrint Arch..

A Compressed $\varSigma $-Protocol Theory for Lattices

Ronald Cramer, Lisa Kohl, Thomas Attema, 2021, CRYPTO.

Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time

Ronald Cramer, Léo Ducas, Benjamin Wesolowski, 2021, J. ACM.

Secure Computation over Integers Modulo Powers of Two

Ronald Cramer, Mark Abspoel, Daniel E. Escudero, 2021, ERCIM News.

Improved single-round secure multiplication using regenerating codes

Ivan Damgård, Ronald Cramer, Chaoping Xing, 2021, IACR Cryptol. ePrint Arch..

Compressed $\varSigma $-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures

Ronald Cramer, Matthieu Rambaud, Thomas Attema, 2021, ASIACRYPT.

Asymptotically-Good Arithmetic Secret Sharing over $\mathbb {Z}/p^{\ell }\mathbb {Z}$ with Strong Multiplication and Its Applications to Efficient MPC

Ronald Cramer, Chaoping Xing, Matthieu Rambaud, 2021, CRYPTO.

Algebraic manipulation detection codes

Carles Padró, Ronald Cramer, Serge Fehr, 2013 .

Share conversion , pseudorandom secret-sharing and applications to secure distributed computing

Yuval Ishai, Ronald Cramer, Ivan Damg̊ard, 2005 .

Primitive Sets over Number Fields and Absolutely Optimal Black-Box Secret Sharing

Ronald Cramer, Serge Fehr, Martijn Stam, 2005 .