Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. Zbl 1055.94011
Cramer, Ronald; Shoup, Victor |
|
2002
|
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. Zbl 0931.94018
Cramer, Ronald; Shoup, Victor |
|
1998
|
Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. Zbl 1045.94013
Cramer, Ronald; Shoup, Victor |
|
2003
|
Proofs of partial knowledge and simplified design of witness hiding protocols. Zbl 0939.94546
Cramer, Ronald; Damgård, Ivan; Schoenmakers, Berry |
|
1994
|
General secure multi-party computation from any linear secret-sharing scheme. Zbl 1082.94515
Cramer, Ronald; Damgård, Ivan; Maurer, Ueli |
|
2000
|
Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. Zbl 1149.94333
Cramer, Ronald; Dodis, Yevgeniy; Fehr, Serge; Padró, Carles; Wichs, Daniel |
|
2008
|
Recovering short generators of principal ideals in cyclotomic rings. Zbl 1371.94630
Cramer, Ronald; Ducas, Léo; Peikert, Chris; Regev, Oded |
|
2016
|
Secure multiparty computation and secret sharing. Zbl 1322.68003
Cramer, Ronald; Damgård, Ivan Bjerre; Nielsen, Jesper Buus |
|
2015
|
Multiparty computation from threshold homomorphic encryption. Zbl 1010.94553
Cramer, Ronald; Damgård, Ivan; Nielsen, Jesper B. |
|
2001
|
Share conversion, pseudorandom secret-sharing and applications to secure computation. Zbl 1079.94541
Cramer, Ronald; Damgård, Ivan; Ishai, Yuval |
|
2005
|
Efficient multiparty computations secure against an adaptive adversary. Zbl 0931.94019
Cramer, Ronald; Damgård, Ivan; Dziembowski, Stefan; Hirt, Martin; Rabin, Tal |
|
1999
|
Modular design of secure yet practical cryptographic protocols. Zbl 0903.94025
Cramer, Ronald John Fitzgerald |
|
1997
|
Algebraic geometric secret sharing schemes and secure multi-party computations over small fields. Zbl 1129.94016
Chen, Hao; Cramer, Ronald |
|
2006
|
\(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority. Zbl 1436.94049
Cramer, Ronald; Damgård, Ivan; Escudero, Daniel; Scholl, Peter; Xing, Chaoping |
|
2018
|
Short Stickelberger class relations and application to Ideal-SVP. Zbl 1411.94057
Cramer, Ronald; Ducas, Léo; Wesolowski, Benjamin |
|
2017
|
Secure computation from random error correcting codes. Zbl 1141.94346
Chen, Hao; Cramer, Ronald; Goldwasser, Shafi; de Haan, Robbert; Vaikuntanathan, Vinod |
|
2007
|
Amortized complexity of information-theoretically secure MPC revisited. Zbl 1457.94201
Cascudo, Ignacio; Cramer, Ronald; Xing, Chaoping; Yuan, Chen |
|
2018
|
Compressed \(\varSigma\)-protocol theory and practical application to plug & play secure algorithmics. Zbl 1504.94095
Attema, Thomas; Cramer, Ronald |
|
2020
|
A compressed \(\varSigma \)-protocol theory for lattices. Zbl 1486.94145
Attema, Thomas; Cramer, Ronald; Kohl, Lisa |
|
2021
|
Multi-authority secret-ballot elections with linear work. Zbl 1304.94044
Cramer, Ronald; Franklin, Matthew; Schoenmakers, Berry; Yung, Moti |
|
1996
|
On the amortized complexity of zero-knowledge protocols. Zbl 1252.94056
Cramer, Ronald; Damgård, Ivan |
|
2009
|
Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free? Zbl 0964.94019
Cramer, Ronald; Damgård, Ivan |
|
1998
|
Bounded CCA2-secure encryption. Zbl 1153.94363
Cramer, Ronald; Hanaoka, Goichiro; Hofheinz, Dennis; Imai, Hideki; Kiltz, Eike; Pass, Rafael; Shelat, Abhi; Vaikuntanathan, Vinod |
|
2007
|
Efficient zero-knowledge proofs of knowledge without intractability assumptions. Zbl 1038.94526
Cramer, Ronald; Damgård, Ivan; MacKenzie, Philip |
|
2000
|
Efficient multi-party computation over rings. Zbl 1038.94554
Cramer, Ronald; Fehr, Serge; Ishai, Yuval; Kushilevitz, Eyal |
|
2003
|
Linear secret sharing schemes from error correcting codes and universal hash functions. Zbl 1371.94665
Cramer, Ronald; Damgård, Ivan Bjerre; Döttling, Nico; Fehr, Serge; Spini, Gabriele |
|
2015
|
Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings. Zbl 1455.94203
Abspoel, Mark; Cramer, Ronald; Damgård, Ivan; Escudero, Daniel; Yuan, Chen |
|
2019
|
Asymptotically good ideal linear secret sharing with strong multiplication over any fixed finite field. Zbl 1252.94106
Cascudo, Ignacio; Chen, Hao; Cramer, Ronald; Xing, Chaoping |
|
2009
|
Optimal black-box secret sharing over arbitrary Abelian groups. Zbl 1026.94546
Cramer, Ronald; Fehr, Serge |
|
2002
|
New generation of secure and practical RSA-based signatures. Zbl 1329.94058
Cramer, Ronald; Damgård, Ivan |
|
1996
|
Asymptotically optimal two-round perfectly secure message transmission. Zbl 1129.94009
Agarwal, Saurabh; Cramer, Ronald; de Haan, Robbert |
|
2006
|
Algebraic manipulation detection codes. Zbl 1336.94078
Cramer, Ronald; Fehr, Serge; Padró, Carles |
|
2013
|
Compressing proofs of \(k\)-out-of-\(n\) partial knowledge. Zbl 1489.94086
Attema, Thomas; Cramer, Ronald; Fehr, Serge |
|
2021
|
Bounds on the threshold gap in secret sharing and its applications. Zbl 1364.94575
Cascudo, Ignacio; Cramer, Ronald; Xing, Chaoping |
|
2013
|
On codes, matroids, and secure multiparty computation from linear secret-sharing schemes. Zbl 1184.94252
Cramer, Ronald; Daza, Vanesa; Gracia, Ignacio; Jiménez-Urroz, Jorge; Leander, Gregor; Martí-Farré, Jaume; Padró, Carles |
|
2008
|
Optimal algebraic manipulation detection codes in the constant-error model. Zbl 1354.94056
Cramer, Ronald; Padró, Carles; Xing, Chaoping |
|
2015
|
Advances in cryptology – EUROCRYPT 2005. 24th annual international conference on the theory and applications of cryptographic techniques, Aarhus, Denmark, May 22–26, 2005. Proceedings. Zbl 1107.94001
|
|
2005
|
On the cost of reconstructing a secret, or VSS with optimal reconstruction phase. Zbl 1003.94534
Cramer, Ronald; Damgård, Ivan; Fehr, Serge |
|
2001
|
Squares of random linear codes. Zbl 1359.94682
Cascudo, Ignacio; Cramer, Ronald; Mirandola, Diego; Zémor, Gilles |
|
2015
|
Secure distributed linear algebra in a constant number of rounds. Zbl 1002.94027
Cramer, Ronald; Damgård, Ivan |
|
2001
|
Secure signature schemes based on interactive protocols. Zbl 0876.94025
Cramer, Ronald; Damgård, Ivan |
|
1995
|
The torsion-limit for algebraic function fields and its application to arithmetic secret sharing. Zbl 1290.94148
Cascudo, Ignacio; Cramer, Ronald; Xing, Chaoping |
|
2011
|
Torsion limits and Riemann-Roch systems for function fields and applications. Zbl 1360.14080
Cascudo, Ignacio; Cramer, Ronald; Xing, Chaoping |
|
2014
|
On codes, matroids and secure multi-party computation from linear secret sharing schemes. Zbl 1145.94462
Cramer, Ronald; Daza, Vanesa; Gracia, Ignacio; Jiménez-Urroz, Jorge; Leander, Gregor; Martí-Farré, Jaume; Padró, Carles |
|
2005
|
Strongly multiplicative ramp schemes from high degree rational points on curves. Zbl 1149.94309
Chen, Hao; Cramer, Ronald; de Haan, Robbert; Pueyo, Ignacio Cascudo |
|
2008
|
Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC. Zbl 1487.94152
Cramer, Ronald; Rambaud, Matthieu; Xing, Chaoping |
|
2021
|
Compressed \(\varSigma \)-protocols for bilinear group arithmetic circuits and application to logarithmic transparent threshold signatures. Zbl 1514.94145
Attema, Thomas; Cramer, Ronald; Rambaud, Matthieu |
|
2021
|
Amortized complexity of zero-knowledge proofs revisited: achieving linear soundness slack. Zbl 1411.94056
Cramer, Ronald; Damgård, Ivan; Xing, Chaoping; Yuan, Chen |
|
2017
|
Mildly short vectors in cyclotomic ideal lattices in quantum polynomial time. Zbl 1499.68122
Cramer, Ronald; Ducas, Léo; Wesolowski, Benjamin |
|
2021
|
Asymptotic bound for multiplication complexity in the extensions of small finite fields. Zbl 1365.11133
Cascudo, Ignacio; Cramer, Ronald; Xing, Chaoping; Yang, An |
|
2012
|
Black-box secret sharing from primitive sets in algebraic number fields. Zbl 1145.94463
Cramer, Ronald; Fehr, Serge; Stam, Martijn |
|
2005
|
Improved privacy in wallets with observers. Zbl 0951.94517
Cramer, R. J. F.; Pedersen, T. P. |
|
1994
|
On the amortized complexity of zero knowledge protocols for multiplicative relations. Zbl 1295.94043
Cramer, Ronald; Damgård, Ivan; Pastro, Valerio |
|
2012
|
Multiparty computation, an introduction. Zbl 1112.68384
Cramer, Ronald; Damgård, Ivan |
|
2005
|
Atomic secure multi-party multiplication with low communication. Zbl 1141.94347
Cramer, Ronald; Damgård, Ivan; de Haan, Robbert |
|
2007
|
Non-interactive distributed-verifier proofs and proving relations among commitments. Zbl 1065.94536
Abe, Masayuki; Cramer, Ronald; Fehr, Serge |
|
2002
|
Secret-key zero-knowlegde and non-interactive verifiable exponentiation. Zbl 1197.94216
Cramer, Ronald; Damgård, Ivan |
|
2004
|
Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \). Zbl 07669170
Abspoel, Mark; Cramer, Ronald; Damgård, Ivan; Escudero, Daniel; Rambaud, Matthieu; Xing, Chaoping; Yuan, Chen |
|
2020
|
Linear zero-knowledge – a note on efficient zero-knowledge proofs and arguments. Zbl 0963.68190
Cramer, Ronald; Damgård, Ivan |
|
1999
|
A twist on the Naor-Yung paradigm and its application to efficient CCA-secure encryption from hard search problems. Zbl 1274.94057
Cramer, Ronald; Hofheinz, Dennis; Kiltz, Eike |
|
2010
|
A note on secure computation of the Moore-Penrose pseudoinverse and its application to secure linear algebra. Zbl 1215.68034
Cramer, Ronald; Kiltz, Eike; Padró, Carles |
|
2007
|
On the amortized complexity of zero-knowledge protocols. Zbl 1297.94063
Cramer, Ronald; Damgård, Ivan; Keller, Marcel |
|
2014
|
An improvement to the Hasse-Weil bound and applications to character sums, cryptography and coding. Zbl 1361.11043
Cramer, Ronald; Xing, Chaoping |
|
2017
|
Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes. Zbl 1479.94304
Cramer, Ronald; Xing, Chaoping |
|
2020
|
The arithmetic codex: theory and applications. (Abstract). Zbl 1281.94021
Cramer, Ronald |
|
2011
|
Improved single-round secure multiplication using regenerating codes. Zbl 1535.94070
Abspoel, Mark; Cramer, Ronald; Escudero, Daniel; Damgård, Ivan; Xing, Chaoping |
|
2021
|
Contemporary cryptology. Zbl 1087.94002
Catalano, Dario; Cramer, Ronald; Darmgård, Ivan; Di Crescenzo, Giovanni; Pointcheval, David; Takagi, Tsuyoshi |
|
2005
|
Proofs of partial knowledge and simplified design of witness hiding protocols. Zbl 0853.94016
Cramer, Ronald; Schoenmakers, Berry; Damgård, Ivan |
|
1995
|
Theory of cryptography. 9th theory of cryptography conference, TCC 2012, Taormina, Sicily, Italy, March 19–21, 2012. Proceedings. Zbl 1238.94002
|
|
2012
|
On the complexity of verifiable secret sharing and multiparty computation. Zbl 1296.94149
Cramer, Ronald; Damgård, Ivan; Dziembowski, Stefan |
|
2000
|
Vector commitments over rings and compressed \(\varSigma \)-protocols. Zbl 1519.94038
Attema, Thomas; Cascudo, Ignacio; Cramer, Ronald; Damgård, Ivan; Escudero, Daniel |
|
2023
|
On the complexity of arithmetic secret sharing. Zbl 1485.94135
Cramer, Ronald; Xing, Chaoping; Yuan, Chen |
|
2020
|
Introduction to secure computation. Zbl 0938.68045
Cramer, Ronald |
|
1999
|
DDH-like assumptions based on extension rings. Zbl 1291.94072
Cramer, Ronald; Damgård, Ivan; Kiltz, Eike; Zakarias, Sarah; Zottarel, Angela |
|
2012
|
On secret sharing with nonlinear product reconstruction. Zbl 1397.94113
Cascudo, Ignacio; Cramer, Ronald; Mirandola, Diego; Padró, Carles; Xing, Chaoping |
|
2015
|
Linear-time non-malleable codes in the bit-wise independent tampering model. Zbl 1417.94053
Cramer, Ronald; Damgård, Ivan; Döttling, Nico; Giacomelli, Irene; Xing, Chaoping |
|
2017
|
Efficient multi-point local decoding of Reed-Muller codes via interleaved codex. Zbl 1433.94153
Cramer, Ronald; Xing, Chaoping; Yuan, Chen |
|
2020
|
Vector commitments over rings and compressed \(\varSigma \)-protocols. Zbl 1519.94038
Attema, Thomas; Cascudo, Ignacio; Cramer, Ronald; Damgård, Ivan; Escudero, Daniel |
|
2023
|
A compressed \(\varSigma \)-protocol theory for lattices. Zbl 1486.94145
Attema, Thomas; Cramer, Ronald; Kohl, Lisa |
|
2021
|
Compressing proofs of \(k\)-out-of-\(n\) partial knowledge. Zbl 1489.94086
Attema, Thomas; Cramer, Ronald; Fehr, Serge |
|
2021
|
Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC. Zbl 1487.94152
Cramer, Ronald; Rambaud, Matthieu; Xing, Chaoping |
|
2021
|
Compressed \(\varSigma \)-protocols for bilinear group arithmetic circuits and application to logarithmic transparent threshold signatures. Zbl 1514.94145
Attema, Thomas; Cramer, Ronald; Rambaud, Matthieu |
|
2021
|
Mildly short vectors in cyclotomic ideal lattices in quantum polynomial time. Zbl 1499.68122
Cramer, Ronald; Ducas, Léo; Wesolowski, Benjamin |
|
2021
|
Improved single-round secure multiplication using regenerating codes. Zbl 1535.94070
Abspoel, Mark; Cramer, Ronald; Escudero, Daniel; Damgård, Ivan; Xing, Chaoping |
|
2021
|
Compressed \(\varSigma\)-protocol theory and practical application to plug & play secure algorithmics. Zbl 1504.94095
Attema, Thomas; Cramer, Ronald |
|
2020
|
Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \). Zbl 07669170
Abspoel, Mark; Cramer, Ronald; Damgård, Ivan; Escudero, Daniel; Rambaud, Matthieu; Xing, Chaoping; Yuan, Chen |
|
2020
|
Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes. Zbl 1479.94304
Cramer, Ronald; Xing, Chaoping |
|
2020
|
On the complexity of arithmetic secret sharing. Zbl 1485.94135
Cramer, Ronald; Xing, Chaoping; Yuan, Chen |
|
2020
|
Efficient multi-point local decoding of Reed-Muller codes via interleaved codex. Zbl 1433.94153
Cramer, Ronald; Xing, Chaoping; Yuan, Chen |
|
2020
|
Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings. Zbl 1455.94203
Abspoel, Mark; Cramer, Ronald; Damgård, Ivan; Escudero, Daniel; Yuan, Chen |
|
2019
|
\(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority. Zbl 1436.94049
Cramer, Ronald; Damgård, Ivan; Escudero, Daniel; Scholl, Peter; Xing, Chaoping |
|
2018
|
Amortized complexity of information-theoretically secure MPC revisited. Zbl 1457.94201
Cascudo, Ignacio; Cramer, Ronald; Xing, Chaoping; Yuan, Chen |
|
2018
|
Short Stickelberger class relations and application to Ideal-SVP. Zbl 1411.94057
Cramer, Ronald; Ducas, Léo; Wesolowski, Benjamin |
|
2017
|
Amortized complexity of zero-knowledge proofs revisited: achieving linear soundness slack. Zbl 1411.94056
Cramer, Ronald; Damgård, Ivan; Xing, Chaoping; Yuan, Chen |
|
2017
|
An improvement to the Hasse-Weil bound and applications to character sums, cryptography and coding. Zbl 1361.11043
Cramer, Ronald; Xing, Chaoping |
|
2017
|
Linear-time non-malleable codes in the bit-wise independent tampering model. Zbl 1417.94053
Cramer, Ronald; Damgård, Ivan; Döttling, Nico; Giacomelli, Irene; Xing, Chaoping |
|
2017
|
Recovering short generators of principal ideals in cyclotomic rings. Zbl 1371.94630
Cramer, Ronald; Ducas, Léo; Peikert, Chris; Regev, Oded |
|
2016
|
Secure multiparty computation and secret sharing. Zbl 1322.68003
Cramer, Ronald; Damgård, Ivan Bjerre; Nielsen, Jesper Buus |
|
2015
|
Linear secret sharing schemes from error correcting codes and universal hash functions. Zbl 1371.94665
Cramer, Ronald; Damgård, Ivan Bjerre; Döttling, Nico; Fehr, Serge; Spini, Gabriele |
|
2015
|
Optimal algebraic manipulation detection codes in the constant-error model. Zbl 1354.94056
Cramer, Ronald; Padró, Carles; Xing, Chaoping |
|
2015
|
Squares of random linear codes. Zbl 1359.94682
Cascudo, Ignacio; Cramer, Ronald; Mirandola, Diego; Zémor, Gilles |
|
2015
|
On secret sharing with nonlinear product reconstruction. Zbl 1397.94113
Cascudo, Ignacio; Cramer, Ronald; Mirandola, Diego; Padró, Carles; Xing, Chaoping |
|
2015
|
Torsion limits and Riemann-Roch systems for function fields and applications. Zbl 1360.14080
Cascudo, Ignacio; Cramer, Ronald; Xing, Chaoping |
|
2014
|
On the amortized complexity of zero-knowledge protocols. Zbl 1297.94063
Cramer, Ronald; Damgård, Ivan; Keller, Marcel |
|
2014
|
Algebraic manipulation detection codes. Zbl 1336.94078
Cramer, Ronald; Fehr, Serge; Padró, Carles |
|
2013
|
Bounds on the threshold gap in secret sharing and its applications. Zbl 1364.94575
Cascudo, Ignacio; Cramer, Ronald; Xing, Chaoping |
|
2013
|
Asymptotic bound for multiplication complexity in the extensions of small finite fields. Zbl 1365.11133
Cascudo, Ignacio; Cramer, Ronald; Xing, Chaoping; Yang, An |
|
2012
|
On the amortized complexity of zero knowledge protocols for multiplicative relations. Zbl 1295.94043
Cramer, Ronald; Damgård, Ivan; Pastro, Valerio |
|
2012
|
Theory of cryptography. 9th theory of cryptography conference, TCC 2012, Taormina, Sicily, Italy, March 19–21, 2012. Proceedings. Zbl 1238.94002
|
|
2012
|
DDH-like assumptions based on extension rings. Zbl 1291.94072
Cramer, Ronald; Damgård, Ivan; Kiltz, Eike; Zakarias, Sarah; Zottarel, Angela |
|
2012
|
The torsion-limit for algebraic function fields and its application to arithmetic secret sharing. Zbl 1290.94148
Cascudo, Ignacio; Cramer, Ronald; Xing, Chaoping |
|
2011
|
The arithmetic codex: theory and applications. (Abstract). Zbl 1281.94021
Cramer, Ronald |
|
2011
|
A twist on the Naor-Yung paradigm and its application to efficient CCA-secure encryption from hard search problems. Zbl 1274.94057
Cramer, Ronald; Hofheinz, Dennis; Kiltz, Eike |
|
2010
|
On the amortized complexity of zero-knowledge protocols. Zbl 1252.94056
Cramer, Ronald; Damgård, Ivan |
|
2009
|
Asymptotically good ideal linear secret sharing with strong multiplication over any fixed finite field. Zbl 1252.94106
Cascudo, Ignacio; Chen, Hao; Cramer, Ronald; Xing, Chaoping |
|
2009
|
Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. Zbl 1149.94333
Cramer, Ronald; Dodis, Yevgeniy; Fehr, Serge; Padró, Carles; Wichs, Daniel |
|
2008
|
On codes, matroids, and secure multiparty computation from linear secret-sharing schemes. Zbl 1184.94252
Cramer, Ronald; Daza, Vanesa; Gracia, Ignacio; Jiménez-Urroz, Jorge; Leander, Gregor; Martí-Farré, Jaume; Padró, Carles |
|
2008
|
Strongly multiplicative ramp schemes from high degree rational points on curves. Zbl 1149.94309
Chen, Hao; Cramer, Ronald; de Haan, Robbert; Pueyo, Ignacio Cascudo |
|
2008
|
Secure computation from random error correcting codes. Zbl 1141.94346
Chen, Hao; Cramer, Ronald; Goldwasser, Shafi; de Haan, Robbert; Vaikuntanathan, Vinod |
|
2007
|
Bounded CCA2-secure encryption. Zbl 1153.94363
Cramer, Ronald; Hanaoka, Goichiro; Hofheinz, Dennis; Imai, Hideki; Kiltz, Eike; Pass, Rafael; Shelat, Abhi; Vaikuntanathan, Vinod |
|
2007
|
Atomic secure multi-party multiplication with low communication. Zbl 1141.94347
Cramer, Ronald; Damgård, Ivan; de Haan, Robbert |
|
2007
|
A note on secure computation of the Moore-Penrose pseudoinverse and its application to secure linear algebra. Zbl 1215.68034
Cramer, Ronald; Kiltz, Eike; Padró, Carles |
|
2007
|
Algebraic geometric secret sharing schemes and secure multi-party computations over small fields. Zbl 1129.94016
Chen, Hao; Cramer, Ronald |
|
2006
|
Asymptotically optimal two-round perfectly secure message transmission. Zbl 1129.94009
Agarwal, Saurabh; Cramer, Ronald; de Haan, Robbert |
|
2006
|
Share conversion, pseudorandom secret-sharing and applications to secure computation. Zbl 1079.94541
Cramer, Ronald; Damgård, Ivan; Ishai, Yuval |
|
2005
|
Advances in cryptology – EUROCRYPT 2005. 24th annual international conference on the theory and applications of cryptographic techniques, Aarhus, Denmark, May 22–26, 2005. Proceedings. Zbl 1107.94001
|
|
2005
|
On codes, matroids and secure multi-party computation from linear secret sharing schemes. Zbl 1145.94462
Cramer, Ronald; Daza, Vanesa; Gracia, Ignacio; Jiménez-Urroz, Jorge; Leander, Gregor; Martí-Farré, Jaume; Padró, Carles |
|
2005
|
Black-box secret sharing from primitive sets in algebraic number fields. Zbl 1145.94463
Cramer, Ronald; Fehr, Serge; Stam, Martijn |
|
2005
|
Multiparty computation, an introduction. Zbl 1112.68384
Cramer, Ronald; Damgård, Ivan |
|
2005
|
Contemporary cryptology. Zbl 1087.94002
Catalano, Dario; Cramer, Ronald; Darmgård, Ivan; Di Crescenzo, Giovanni; Pointcheval, David; Takagi, Tsuyoshi |
|
2005
|
Secret-key zero-knowlegde and non-interactive verifiable exponentiation. Zbl 1197.94216
Cramer, Ronald; Damgård, Ivan |
|
2004
|
Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. Zbl 1045.94013
Cramer, Ronald; Shoup, Victor |
|
2003
|
Efficient multi-party computation over rings. Zbl 1038.94554
Cramer, Ronald; Fehr, Serge; Ishai, Yuval; Kushilevitz, Eyal |
|
2003
|
Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. Zbl 1055.94011
Cramer, Ronald; Shoup, Victor |
|
2002
|
Optimal black-box secret sharing over arbitrary Abelian groups. Zbl 1026.94546
Cramer, Ronald; Fehr, Serge |
|
2002
|
Non-interactive distributed-verifier proofs and proving relations among commitments. Zbl 1065.94536
Abe, Masayuki; Cramer, Ronald; Fehr, Serge |
|
2002
|
Multiparty computation from threshold homomorphic encryption. Zbl 1010.94553
Cramer, Ronald; Damgård, Ivan; Nielsen, Jesper B. |
|
2001
|
On the cost of reconstructing a secret, or VSS with optimal reconstruction phase. Zbl 1003.94534
Cramer, Ronald; Damgård, Ivan; Fehr, Serge |
|
2001
|
Secure distributed linear algebra in a constant number of rounds. Zbl 1002.94027
Cramer, Ronald; Damgård, Ivan |
|
2001
|
General secure multi-party computation from any linear secret-sharing scheme. Zbl 1082.94515
Cramer, Ronald; Damgård, Ivan; Maurer, Ueli |
|
2000
|
Efficient zero-knowledge proofs of knowledge without intractability assumptions. Zbl 1038.94526
Cramer, Ronald; Damgård, Ivan; MacKenzie, Philip |
|
2000
|
On the complexity of verifiable secret sharing and multiparty computation. Zbl 1296.94149
Cramer, Ronald; Damgård, Ivan; Dziembowski, Stefan |
|
2000
|
Efficient multiparty computations secure against an adaptive adversary. Zbl 0931.94019
Cramer, Ronald; Damgård, Ivan; Dziembowski, Stefan; Hirt, Martin; Rabin, Tal |
|
1999
|
Linear zero-knowledge – a note on efficient zero-knowledge proofs and arguments. Zbl 0963.68190
Cramer, Ronald; Damgård, Ivan |
|
1999
|
Introduction to secure computation. Zbl 0938.68045
Cramer, Ronald |
|
1999
|
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. Zbl 0931.94018
Cramer, Ronald; Shoup, Victor |
|
1998
|
Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free? Zbl 0964.94019
Cramer, Ronald; Damgård, Ivan |
|
1998
|
Modular design of secure yet practical cryptographic protocols. Zbl 0903.94025
Cramer, Ronald John Fitzgerald |
|
1997
|
Multi-authority secret-ballot elections with linear work. Zbl 1304.94044
Cramer, Ronald; Franklin, Matthew; Schoenmakers, Berry; Yung, Moti |
|
1996
|
New generation of secure and practical RSA-based signatures. Zbl 1329.94058
Cramer, Ronald; Damgård, Ivan |
|
1996
|
Secure signature schemes based on interactive protocols. Zbl 0876.94025
Cramer, Ronald; Damgård, Ivan |
|
1995
|
Proofs of partial knowledge and simplified design of witness hiding protocols. Zbl 0853.94016
Cramer, Ronald; Schoenmakers, Berry; Damgård, Ivan |
|
1995
|
Proofs of partial knowledge and simplified design of witness hiding protocols. Zbl 0939.94546
Cramer, Ronald; Damgård, Ivan; Schoenmakers, Berry |
|
1994
|
Improved privacy in wallets with observers. Zbl 0951.94517
Cramer, R. J. F.; Pedersen, T. P. |
|
1994
|