| Publication | Date of Publication | Type |
|---|
| Verifiable computation for approximate homomorphic encryption schemes | 2026-02-06 | Paper |
| Publicly verifiable secret sharing over class groups and applications to DKG and YOSO | 2024-11-13 | Paper |
| On sigma-protocols and (packed) black-box secret sharing schemes | 2024-11-12 | Paper |
YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-25 | Paper |
Vector commitments over rings and compressed \(\varSigma \)-protocols
Theory of Cryptography | 2023-08-14 | Paper |
On interactive oracle proofs for Boolean R1CS statements
Financial Cryptography and Data Security | 2023-05-26 | Paper |
| ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing | 2023-03-29 | Paper |
| SCRAPE: scalable randomness attested by public entities | 2022-07-01 | Paper |
| A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity | 2022-03-23 | Paper |
| Flexible and efficient verifiable computation on encrypted data | 2021-12-21 | Paper |
A note on secure multiparty computation via higher residue symbols
Journal of Mathematical Cryptology | 2021-07-14 | Paper |
| Amortized complexity of information-theoretically secure MPC revisited | 2020-06-30 | Paper |
| Efficient UC commitment extension with homomorphism for free (and applications) | 2020-05-05 | Paper |
Squares of matrix-product codes
Finite Fields and their Applications | 2020-02-26 | Paper |
Improved Bounds on the Threshold Gap in Ramp Secret Sharing
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
On Squares of Cyclic Codes
IEEE Transactions on Information Theory | 2019-01-28 | Paper |
| Actively secure OT-extension from \(q\)-ary linear codes | 2018-10-17 | Paper |
| Resource-efficient OT combiners with active security | 2018-01-19 | Paper |
Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields
IEEE Transactions on Information Theory | 2017-07-12 | 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 |
Oblivious transfer from any non-trivial elastic noisy channel via secret key agreement
Theory of Cryptography | 2016-12-21 | Paper |
Rate-1, linear time and additively homomorphic UC commitments
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
Secret Sharing Schemes with Algebraic Properties and Applications
Pursuit of the Universal | 2016-08-17 | Paper |
Additively homomorphic UC commitments with optimal amortized overhead
Lecture Notes in Computer Science | 2015-08-27 | Paper |
On secret sharing with nonlinear product reconstruction
SIAM Journal on Discrete Mathematics | 2015-07-21 | Paper |
The torsion-limit for algebraic function fields and its application to arithmetic secret sharing
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
