| Publication | Date of Publication | Type |
|---|
Protecting distributed primitives against leakage: equivocal secret sharing and more
Journal of Cryptology | 2024-11-15 | Paper |
Can Alice and Bob guarantee output to Carol?
| 2024-11-13 | Paper |
The price of active security in cryptographic protocols
Journal of Cryptology | 2024-08-30 | Paper |
Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
| 2024-08-01 | Paper |
Your reputation's safe with me: framing-free distributed zero-knowledge proofs
| 2024-08-01 | Paper |
Protecting distributed primitives against leakage: equivocal secret sharing and more
| 2024-06-25 | Paper |
Best of both worlds. Revisiting the spymasters double agent problem
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Private polynomial commitments and applications to MPC
Lecture Notes in Computer Science | 2023-11-16 | Paper |
Ligero: lightweight sublinear arguments without a trusted setup
Designs, Codes and Cryptography | 2023-11-07 | Paper |
On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
Theory of Cryptography | 2023-08-14 | Paper |
Actively secure garbled circuits with constant communication overhead in the plain model
Journal of Cryptology | 2023-07-26 | Paper |
scientific article; zbMATH DE number 7706038 (Why is no real title available?)
| 2023-07-03 | Paper |
Adaptively secure computation for RAM programs
| 2022-08-30 | Paper |
ZK-PCPs from leakage-resilient secret sharing
Journal of Cryptology | 2022-08-01 | Paper |
The price of active security in cryptographic protocols
| 2022-03-23 | Paper |
Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
SIAM Journal on Computing | 2022-02-08 | Paper |
Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?
| 2021-12-01 | Paper |
Going beyond dual execution: MPC for functions with efficient verification
| 2021-12-01 | Paper |
Round-optimal secure multi-party computation
Journal of Cryptology | 2021-07-30 | Paper |
On the power of secure two-party computation
Journal of Cryptology | 2020-03-03 | Paper |
What security can we achieve within 4 rounds?
Journal of Cryptology | 2019-11-27 | Paper |
On black-box complexity of universally composable security in the CRS model
Journal of Cryptology | 2019-08-13 | Paper |
Two-round adaptively secure multiparty computation from standard assumptions
| 2018-12-11 | Paper |
Round-optimal fully black-box zero-knowledge arguments from one-way permutations
| 2018-12-11 | Paper |
Round-optimal secure multi-party computation
Lecture Notes in Computer Science | 2018-09-26 | Paper |
A unified approach to constructing black-box UC protocols in trusted setup models
| 2018-01-19 | Paper |
Actively secure garbled circuits with constant communication overhead in the plain model
| 2018-01-19 | Paper |
Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Better two-round adaptive multi-party computation
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Scalable multi-party private set-intersection
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Constant round adaptively secure protocols in the tamper-proof hardware model
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
Theory of Cryptography | 2016-12-21 | Paper |
Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
Theory of Cryptography | 2016-12-21 | Paper |
On the Power of Secure Two-Party Computation
Advances in Cryptology – CRYPTO 2016 | 2016-10-27 | Paper |
What Security Can We Achieve Within 4 Rounds?
Lecture Notes in Computer Science | 2016-10-21 | Paper |
Secure computation from millionaire
Advances in Cryptology -- ASIACRYPT 2015 | 2016-06-10 | Paper |
On Black-Box Complexity of Universally Composable Security in the CRS Model
Advances in Cryptology – ASIACRYPT 2015 | 2016-03-23 | Paper |
A parallel repetition theorem for constant-round Arthur-Merlin proofs
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
A unified framework for concurrent security
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
On adaptively secure protocols
Lecture Notes in Computer Science | 2014-10-14 | Paper |
Concurrent zero knowledge, revisited
Journal of Cryptology | 2014-04-01 | Paper |
4-round resettably-sound zero knowledge
Theory of Cryptography | 2014-02-18 | Paper |
Adaptive and concurrent secure computation from new adaptive, non-malleable commitments
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
A unified framework for UC from only OT
Advances in Cryptology – ASIACRYPT 2012 | 2013-03-19 | Paper |
The generalized randomized iterate and its application to new efficient constructions of uowhfs from regular one-way functions
Advances in Cryptology – ASIACRYPT 2012 | 2013-03-19 | Paper |
Towards non-black-box lower bounds in cryptography
Theory of Cryptography | 2011-05-19 | Paper |
Concurrent non-malleable zero knowledge proofs
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
Private coins versus public coins in zero-knowledge proof systems
Theory of Cryptography | 2010-02-24 | Paper |
Eye for an eye: efficient concurrent zero-knowledge in the timing model
Theory of Cryptography | 2010-02-24 | Paper |
scientific article; zbMATH DE number 5485477 (Why is no real title available?)
| 2009-01-05 | Paper |
Precise Concurrent Zero Knowledge
Advances in Cryptology – EUROCRYPT 2008 | 2008-04-15 | Paper |
Concurrent Non-malleable Commitments from Any One-Way Function
Theory of Cryptography | 2008-03-05 | Paper |
On Constant-Round Concurrent Zero-Knowledge
Theory of Cryptography | 2008-03-05 | Paper |
