Ronald Cramer

From MaRDI portal
Person:509670

Available identifiers

zbMath Open cramer.ronaldDBLPc/RonaldCramerWikidataQ7364760 ScholiaQ7364760MaRDI QIDQ509670

List of research outcomes





PublicationDate of PublicationType
Vector commitments over rings and compressed \(\varSigma \)-protocols2023-08-14Paper
Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures2023-05-26Paper
Improved single-round secure multiplication using regenerating codes2023-05-12Paper
Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)2023-03-29Paper
Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time2022-12-08Paper
Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics2022-12-07Paper
Compressing proofs of \(k\)-out-of-\(n\) partial knowledge2022-05-18Paper
A compressed \(\varSigma \)-protocol theory for lattices2022-04-22Paper
Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC2022-04-22Paper
On the complexity of arithmetic secret sharing2022-03-23Paper
Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes2021-12-01Paper
Amortized complexity of information-theoretically secure MPC revisited2020-06-30Paper
Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings2020-04-30Paper
Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex2020-01-28Paper
\(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority2018-09-26Paper
Linear-time non-malleable codes in the bit-wise independent tampering model2018-03-16Paper
Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields2017-07-12Paper
Short Stickelberger Class Relations and Application to Ideal-SVP2017-06-13Paper
Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack2017-06-13Paper
Bounds on the Threshold Gap in Secret Sharing and its Applications2017-06-08Paper
Torsion Limits and Riemann-Roch Systems for Function Fields and Applications2017-05-16Paper
Squares of Random Linear Codes2017-04-28Paper
An improvement to the Hasse-Weil bound and applications to character sums, cryptography and coding2017-02-17Paper
Recovering Short Generators of Principal Ideals in Cyclotomic Rings2016-07-15Paper
New Generation of Secure and Practical RSA-Based Signatures2015-11-11Paper
Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions2015-09-30Paper
Secure Multiparty Computation and Secret Sharing2015-08-06Paper
On Secret Sharing with Nonlinear Product Reconstruction2015-07-21Paper
Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model2015-07-06Paper
On the complexity of verifiable secret sharing and multiparty computation2014-09-26Paper
On the amortized complexity of zero-knowledge protocols2014-09-25Paper
Multi-Authority Secret-Ballot Elections with Linear Work2014-08-20Paper
Algebraic manipulation detection codes2014-03-05Paper
On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations2012-11-06Paper
DDH-Like Assumptions Based on Extension Rings2012-07-20Paper
Torsion Limits and Riemann-Roch Systems for Function Fields and Applications2011-08-12Paper
The Arithmetic Codex: Theory and Applications2011-05-27Paper
A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems2010-02-24Paper
Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field2009-10-20Paper
On the Amortized Complexity of Zero-Knowledge Protocols2009-10-20Paper
Theory of Cryptography2009-05-14Paper
A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra2009-03-10Paper
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes2009-02-24Paper
Bounded CCA2-Secure Encryption2008-05-15Paper
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors2008-04-15Paper
Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves2008-04-15Paper
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes2008-03-17Paper
Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields2008-03-17Paper
Secure Computation from Random Error Correcting Codes2007-11-29Paper
Atomic Secure Multi-party Multiplication with Low Communication2007-11-29Paper
Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields2007-09-04Paper
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission2007-09-04Paper
https://portal.mardi4nfdi.de/entity/Q54890592006-09-25Paper
https://portal.mardi4nfdi.de/entity/Q33749182006-03-01Paper
Theory of Cryptography2005-12-07Paper
Contemporary cryptology.2005-08-30Paper
https://portal.mardi4nfdi.de/entity/Q47372352004-08-11Paper
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack2004-01-08Paper
https://portal.mardi4nfdi.de/entity/Q44349012003-11-26Paper
Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments2003-07-16Paper
https://portal.mardi4nfdi.de/entity/Q44091242003-06-30Paper
https://portal.mardi4nfdi.de/entity/Q47837432002-12-08Paper
https://portal.mardi4nfdi.de/entity/Q47837222002-12-08Paper
https://portal.mardi4nfdi.de/entity/Q31496712002-09-30Paper
https://portal.mardi4nfdi.de/entity/Q42493482001-07-23Paper
https://portal.mardi4nfdi.de/entity/Q45270112001-02-28Paper
https://portal.mardi4nfdi.de/entity/Q49406952000-03-01Paper
https://portal.mardi4nfdi.de/entity/Q49347362000-02-01Paper
https://portal.mardi4nfdi.de/entity/Q49500562000-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42493171999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42507701999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42508961999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q43942111998-06-11Paper
https://portal.mardi4nfdi.de/entity/Q43434431997-12-01Paper
https://portal.mardi4nfdi.de/entity/Q48801461997-01-06Paper

Research outcomes over time

This page was built for person: Ronald Cramer