| Publication | Date of Publication | Type |
|---|
| Weighted secret sharing from wiretap channels | 2024-11-22 | Paper |
| SPRINT: high-throughput robust distributed Schnorr signatures | 2024-11-13 | Paper |
| Anonymous counting tokens | 2024-06-26 | Paper |
| Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation | 2023-04-13 | Paper |
On the (in)security of ROS
Journal of Cryptology | 2022-09-23 | Paper |
| Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms | 2022-08-25 | Paper |
Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
Computer Security -- ESORICS 2015 | 2022-08-19 | Paper |
| Mr NISC: multiparty reusable non-interactive secure computation | 2022-03-23 | Paper |
On the (in)security of ROS
Lecture Notes in Computer Science | 2021-12-08 | Paper |
| Multiparty reusable non-interactive secure computation from LWE | 2021-12-08 | Paper |
| Can a public blockchain keep a secret? | 2021-12-01 | Paper |
On the local leakage resilience of linear secret sharing schemes
Journal of Cryptology | 2021-06-28 | Paper |
| From single-input to multi-client inner-product functional encryption | 2020-05-11 | Paper |
| Algebraic XOR-RKA-secure pseudorandom functions from post-zeroizing multilinear maps | 2020-05-05 | Paper |
| Decentralizing inner-product functional encryption | 2020-01-28 | Paper |
On the tightness of forward-secure signature reductions
Journal of Cryptology | 2019-01-29 | Paper |
| Two-round adaptively secure multiparty computation from standard assumptions | 2018-12-11 | Paper |
Related-key security for pseudorandom functions beyond the linear barrier
Journal of Cryptology | 2018-11-01 | Paper |
On the local leakage resilience of linear secret sharing schemes
Lecture Notes in Computer Science | 2018-09-12 | Paper |
Optimization of bootstrapping in circuits
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits | 2018-07-09 | Paper |
| Hash proof systems over lattices revisited | 2018-05-29 | Paper |
| Robust non-interactive multiparty computation against constant-size collusion | 2017-11-03 | Paper |
| Private multiplication over finite fields | 2017-10-27 | Paper |
CCA-secure inner-product functional encryption from projective hash functions
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Removing erasures with explainable hash proof systems
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Efficient cryptosystems from \(2^k\)-th power residue symbols
Journal of Cryptology | 2017-05-22 | Paper |
Randomness complexity of private circuits for multiplication
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
Multilinear and Aggregate Pseudorandom Functions: New Constructions and Improved Security
Advances in Cryptology -- ASIACRYPT 2015 | 2016-06-10 | Paper |
Easing Coppersmith methods using analytic combinatorics: applications to public-key cryptography with weak pseudorandomness
Public-Key Cryptography – PKC 2016 | 2016-04-13 | Paper |
Implicit zero-knowledge arguments and applications to the malicious setting
Lecture Notes in Computer Science | 2015-12-10 | Paper |
An algebraic framework for pseudorandom functions and applications to related-key security
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Disjunctions for Hash Proof Systems: New Constructions and Applications
Advances in Cryptology - EUROCRYPT 2015 | 2015-09-30 | Paper |
Public-key encryption indistinguishable under plaintext-checkable attacks
Lecture Notes in Computer Science | 2015-08-27 | Paper |
Better zero-knowledge proofs for lattice encryption and their application to group signatures
Lecture Notes in Computer Science | 2015-01-16 | Paper |
Related-key security for pseudorandom functions beyond the linear barrier
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
SPHF-friendly non-interactive commitments
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
New techniques for SPHFs and efficient one-round PAKE protocols
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
Tighter Reductions for Forward-Secure Signature Schemes
Public-Key Cryptography – PKC 2013 | 2013-04-19 | Paper |
Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
Public-Key Cryptography – PKC 2013 | 2013-04-19 | Paper |
