| Publication | Date of Publication | Type |
|---|
Vector commitments over rings and compressed \(\varSigma \)-protocols
Theory of Cryptography | 2023-08-14 | Paper |
Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
Lecture Notes in Computer Science | 2023-05-26 | Paper |
Improved single-round secure multiplication using regenerating codes
Lecture Notes in Computer Science | 2023-05-12 | Paper |
| Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) | 2023-03-29 | Paper |
Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time
Journal of the ACM | 2022-12-08 | Paper |
| Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics | 2022-12-07 | Paper |
| Compressing proofs of \(k\)-out-of-\(n\) partial knowledge | 2022-05-18 | Paper |
| A compressed \(\varSigma \)-protocol theory for lattices | 2022-04-22 | Paper |
| Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC | 2022-04-22 | Paper |
| On the complexity of arithmetic secret sharing | 2022-03-23 | Paper |
| Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes | 2021-12-01 | Paper |
| Amortized complexity of information-theoretically secure MPC revisited | 2020-06-30 | Paper |
| Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings | 2020-04-30 | Paper |
Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
| \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority | 2018-09-26 | Paper |
| Linear-time non-malleable codes in the bit-wise independent tampering model | 2018-03-16 | Paper |
Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Short Stickelberger class relations and application to Ideal-SVP
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Amortized complexity of zero-knowledge proofs revisited: achieving linear soundness slack
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Bounds on the Threshold Gap in Secret Sharing and its Applications
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Torsion limits and Riemann-Roch systems for function fields and applications
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Squares of Random Linear Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
An improvement to the Hasse-Weil bound and applications to character sums, cryptography and coding
Advances in Mathematics | 2017-02-17 | Paper |
Recovering short generators of principal ideals in cyclotomic rings
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
New generation of secure and practical RSA-based signatures
Advances in Cryptology — CRYPTO ’96 | 2015-11-11 | Paper |
Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
Advances in Cryptology - EUROCRYPT 2015 | 2015-09-30 | Paper |
| Secure multiparty computation and secret sharing | 2015-08-06 | Paper |
On secret sharing with nonlinear product reconstruction
SIAM Journal on Discrete Mathematics | 2015-07-21 | Paper |
Optimal algebraic manipulation detection codes in the constant-error model
Theory of Cryptography | 2015-07-06 | Paper |
On the complexity of verifiable secret sharing and multiparty computation
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
On the amortized complexity of zero-knowledge protocols
Journal of Cryptology | 2014-09-25 | Paper |
Multi-authority secret-ballot elections with linear work
Advances in Cryptology — EUROCRYPT ’96 | 2014-08-20 | Paper |
Algebraic manipulation detection codes
Science China. Mathematics | 2014-03-05 | Paper |
On the amortized complexity of zero knowledge protocols for multiplicative relations
Lecture Notes in Computer Science | 2012-11-06 | Paper |
DDH-like assumptions based on extension rings
Public Key Cryptography – PKC 2012 | 2012-07-20 | Paper |
The torsion-limit for algebraic function fields and its application to arithmetic secret sharing
Lecture Notes in Computer Science | 2011-08-12 | Paper |
The arithmetic codex: theory and applications. (Abstract)
Advances in Cryptology – EUROCRYPT 2011 | 2011-05-27 | Paper |
A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems
Theory of Cryptography | 2010-02-24 | Paper |
Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
On the Amortized Complexity of Zero-Knowledge Protocols
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2009-05-14 | Paper |
A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Bounded CCA2-Secure Encryption
Advances in Cryptology – ASIACRYPT 2007 | 2008-05-15 | Paper |
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
Advances in Cryptology – EUROCRYPT 2008 | 2008-04-15 | Paper |
Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
Advances in Cryptology – EUROCRYPT 2008 | 2008-04-15 | Paper |
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Advances in Cryptology – CRYPTO 2005 | 2008-03-17 | Paper |
Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
Advances in Cryptology – CRYPTO 2005 | 2008-03-17 | Paper |
Secure Computation from Random Error Correcting Codes
Advances in Cryptology - EUROCRYPT 2007 | 2007-11-29 | Paper |
Atomic Secure Multi-party Multiplication with Low Communication
Advances in Cryptology - EUROCRYPT 2007 | 2007-11-29 | Paper |
Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
Lecture Notes in Computer Science | 2007-09-04 | Paper |
| Multiparty computation, an introduction | 2006-09-25 | Paper |
| General secure multi-party computation from any linear secret-sharing scheme | 2006-03-01 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Contemporary cryptology.
Advanced Courses in Mathematics -- CRM Barcelona | 2005-08-30 | Paper |
| scientific article; zbMATH DE number 2086698 (Why is no real title available?) | 2004-08-11 | Paper |
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
SIAM Journal on Computing | 2004-01-08 | Paper |
| scientific article; zbMATH DE number 2009982 (Why is no real title available?) | 2003-11-26 | Paper |
Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
Lecture Notes in Computer Science | 2003-07-16 | Paper |
| scientific article; zbMATH DE number 1942426 (Why is no real title available?) | 2003-06-30 | Paper |
| scientific article; zbMATH DE number 1842509 (Why is no real title available?) | 2002-12-08 | Paper |
| scientific article; zbMATH DE number 1842488 (Why is no real title available?) | 2002-12-08 | Paper |
| scientific article; zbMATH DE number 1808209 (Why is no real title available?) | 2002-09-30 | Paper |
| scientific article; zbMATH DE number 1302863 (Why is no real title available?) | 2001-07-23 | Paper |
| scientific article; zbMATH DE number 1559559 (Why is no real title available?) | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1406779 (Why is no real title available?) | 2000-03-01 | Paper |
| scientific article; zbMATH DE number 1394320 (Why is no real title available?) | 2000-02-01 | Paper |
| scientific article; zbMATH DE number 1440068 (Why is no real title available?) | 2000-01-01 | Paper |
| scientific article; zbMATH DE number 1302835 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1304080 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1304184 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1162684 (Why is no real title available?) | 1998-06-11 | Paper |
| scientific article; zbMATH DE number 1031000 (Why is no real title available?) | 1997-12-01 | Paper |
| scientific article; zbMATH DE number 883898 (Why is no real title available?) | 1997-01-06 | Paper |
