| Publication | Date of Publication | Type |
|---|
From privacy-only to simulatable OT: black-box, round-optimal, information-theoretic
| 2024-06-25 | Paper |
Black-box anonymous commit-and-prove
Lecture Notes in Computer Science | 2023-07-25 | Paper |
One-time traceable ring signatures
| 2022-06-24 | Paper |
Publicly verifiable zero knowledge from (collapsing) blockchains
| 2021-12-21 | Paper |
Threshold ring signatures: new definitions and post-quantum security
| 2021-12-01 | Paper |
Break-glass encryption
| 2020-01-28 | Paper |
Publicly verifiable proofs from blockchains
| 2020-01-28 | Paper |
Population stability. Regulating size in the presence of an adversary
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
Adaptively indistinguishable garbled circuits
| 2018-01-19 | Paper |
Sublinear zero-knowledge arguments for RAM programs
Lecture Notes in Computer Science | 2017-06-13 | Paper |
NIZKs with an untrusted CRS: security in the face of parameter subversion
Advances in Cryptology – ASIACRYPT 2016 | 2017-01-06 | Paper |
Adaptively secure garbled circuits from one-way functions
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
Online/offline OR composition of sigma protocols
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
Improved OR-composition of sigma-protocols
Theory of Cryptography | 2016-04-08 | Paper |
Round-optimal black-box two-party computation
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Garbled RAM from one-way functions
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Resettably sound zero-knowledge arguments from OWFs -- the (semi) black-box way
Theory of Cryptography | 2015-07-06 | Paper |
Black-box non-black-box zero knowledge
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Unconditionally secure and universally composable commitments from physical assumptions
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings | 2013-05-31 | Paper |
Revisiting lower and upper bounds for selective decommitments
Theory of Cryptography | 2013-03-18 | Paper |
On round-optimal zero knowledge in the bare public-key model
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
Simultaneously resettable arguments of knowledge
Theory of Cryptography | 2012-06-15 | Paper |
