| Publication | Date of Publication | Type |
|---|
Unconditional quantum cryptography with a bounded number of keys
IACR Communications in Cryptology | 2026-09-09 | Paper |
| How to copy-protect malleable-puncturable cryptographic functionalities under arbitrary challenge distributions: a unified solution to quantum protection | 2026-07-20 | Paper |
| Proofs of no intrusion | 2026-07-20 | Paper |
| Traceable secret sharing revisited | 2026-07-20 | Paper |
| Round-efficient composable two-party quantum computation | 2026-04-23 | Paper |
| Towards building scalable constant-round MPC from minimal assumptions via round collapsing | 2026-02-04 | Paper |
| Quantum key leasing for PKE and FHE with a classical lessor | 2025-11-20 | Paper |
Towards accountability in CRS generation
Journal of Cryptology | 2025-09-30 | Paper |
| Extractors and secret sharing against bounded collusion protocols | 2025-08-12 | Paper |
| Non-malleable commitments using Goldreich-Levin list decoding | 2025-08-12 | Paper |
| Laconic conditional disclosure of secrets and applications | 2025-08-12 | Paper |
| Breaking the three round barrier for non-malleable commitments | 2025-08-06 | Paper |
| Bounded-communication leakage resilience via parity-resilient circuits | 2025-08-06 | Paper |
| An algebraic approach to non-malleability | 2025-08-05 | Paper |
| Unclonable cryptography with unbounded collusions and impossibility of hyperefficient shadow tomography | 2025-07-25 | Paper |
| Unclonable commitments and proofs | 2025-07-25 | Paper |
| Unbounded leakage-resilience and intrusion-detection in a quantum world | 2025-07-25 | Paper |
| Split-state non-malleable codes and secret sharing schemes for quantum messages | 2025-07-25 | Paper |
Split-state non-malleable codes and secret sharing schemes for quantum messages
IEEE Transactions on Information Theory | 2025-07-11 | Paper |
| Dishonest majority constant-round MPC with linear communication from DDH | 2025-07-03 | Paper |
| Unclonable secret sharing | 2025-07-03 | Paper |
| Constructing non-malleable commitments: a black-box approach | 2025-05-05 | Paper |
| Positive results for concurrently secure computation in the plain model | 2025-05-05 | Paper |
| NIZKs with maliciously chosen CRS: subversion advice-ZK and accountable soundness | 2025-01-10 | Paper |
| Towards achieving asynchronous MPC with linear communication and optimal resilience | 2024-12-13 | Paper |
| Asymmetric multi-party computation | 2024-11-22 | Paper |
| Computational quantum secret sharing | 2024-11-20 | Paper |
| Software with certified deletion | 2024-11-13 | Paper |
| Asynchronous multi-party quantum computation | 2024-09-25 | Paper |
| Interaction-preserving compilers for secure computation | 2024-04-09 | Paper |
| scientific article; zbMATH DE number 7829313 (Why is no real title available?) | 2024-04-09 | Paper |
On concurrent multi-party quantum computation
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
Reusable secure computation in the plain model
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
\textsc{SuperPack}: dishonest majority MPC with constant online communication
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Steganography-free zero-knowledge
Theory of Cryptography | 2023-08-14 | Paper |
Sharing transformation and dishonest majority MPC with packed secret sharing
Advances in Cryptology – CRYPTO 2022 | 2023-07-07 | Paper |
Tight bounds on the randomness complexity of secure multiparty computation
Advances in Cryptology – CRYPTO 2022 | 2023-07-07 | Paper |
| Blockchains enable non-interactive MPC | 2023-04-13 | Paper |
| Oblivious transfer from trapdoor permutations in minimal rounds | 2023-04-13 | Paper |
| Two-round maliciously secure computation with super-polynomial simulation | 2023-03-31 | Paper |
| The round complexity of secure computation against covert adversaries | 2022-12-16 | Paper |
| Guaranteed output delivery comes free in honest majority MPC | 2022-11-09 | Paper |
| Round-optimal Byzantine agreement | 2022-08-30 | Paper |
| Private circuits with quasilinear randomness | 2022-08-30 | Paper |
Storing and retrieving secrets on a blockchain
Public-Key Cryptography – PKC 2022 | 2022-07-08 | Paper |
| Instant block confirmation in the sleepy model | 2022-06-22 | Paper |
| ATLAS: efficient and scalable MPC in the honest majority setting | 2022-04-22 | Paper |
| Unconditional communication-efficient MPC via Hall's marriage theorem | 2022-04-22 | Paper |
| Traceable secret sharing and applications | 2022-04-22 | Paper |
| Round optimal secure multiparty computation from minimal assumptions | 2022-03-23 | Paper |
Post-quantum multi-party computation
(available as arXiv preprint) | 2021-12-08 | Paper |
| Multi-source non-malleable extractors and applications | 2021-12-08 | Paper |
| Threshold garbled circuits and ad hoc secure computation | 2021-12-08 | Paper |
| Towards accountability in CRS generation | 2021-12-08 | Paper |
| Statistical Zaps and new oblivious transfer protocols | 2021-12-01 | Paper |
An Algebraic Approach to Nonmalleability
SIAM Journal on Computing | 2021-10-18 | Paper |
Extractors for adversarial sources via extremal hypergraphs
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Nonmalleable extractors and codes, with their many tampered extensions
SIAM Journal on Computing | 2020-10-26 | Paper |
| Interactive non-malleable codes | 2020-04-30 | Paper |
| Communication-efficient unconditional MPC with guaranteed output delivery | 2020-03-09 | Paper |
| Simultaneous amplification: the case of non-interactive zero-knowledge | 2020-03-09 | Paper |
| Founding secure computation on blockchains | 2020-02-06 | Paper |
| Correlated-source extractors and cryptography with correlated-random tapes | 2020-02-04 | Paper |
Non-malleable secret sharing
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| Promise zero knowledge and its applications to round optimal MPC | 2018-09-26 | Paper |
| Non-malleable secret sharing for general access structures | 2018-09-12 | Paper |
| On the existence of three round zero-knowledge proofs | 2018-07-17 | Paper |
| scientific article; zbMATH DE number 6866298 (Why is no real title available?) | 2018-05-03 | Paper |
| Overcoming cryptographic impossibility results using blockchains | 2018-01-19 | Paper |
| Round optimal concurrent MPC via strong simulation | 2018-01-19 | Paper |
| Do distributed differentially-private protocols require oblivious transfer? | 2017-12-19 | Paper |
| Block-wise non-malleable codes | 2017-12-19 | Paper |
Non-malleable extractors and codes, with their many tampered extensions
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Textbook non-malleable commitments
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Multi-input functional encryption with unbounded-message security
Advances in Cryptology – ASIACRYPT 2016 | 2017-01-06 | Paper |
Verifiable functional encryption
Advances in Cryptology – ASIACRYPT 2016 | 2017-01-06 | Paper |
Concurrent secure computation via non-black box simulation
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Concurrent secure computation with optimal query complexity
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
Theory of Cryptography | 2015-07-06 | Paper |
Functional encryption for randomized functionalities
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 |
Position-based cryptography
SIAM Journal on Computing | 2014-11-14 | Paper |
On-line/off-line leakage resilient secure computation protocols
Lecture Notes in Computer Science | 2014-08-20 | Paper |
On the round complexity of covert computation
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Interactive proofs under continual memory leakage
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Non-black-box simulation in the fully concurrent setting
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Stateless Cryptographic Protocols
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Constant round non-malleable protocols using one way functions
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Position-based quantum cryptography: impossibility and constructions
SIAM Journal on Computing | 2014-06-04 | Paper |
Multi-input functional encryption
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing
Public-Key Cryptography – PKC 2014 | 2014-03-25 | Paper |
Lower Bounds in the Hardware Token Model
Theory of Cryptography | 2014-02-18 | Paper |
Constant-round concurrent zero knowledge in the bounded player model
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
What Information Is Leaked under Concurrent Composition?
Advances in Cryptology – CRYPTO 2013 | 2013-09-17 | Paper |
Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
On concurrently secure computation in the multiple ideal query model
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 |
Concurrent zero knowledge in the bounded player model
Theory of Cryptography | 2013-03-18 | Paper |
On the (in)security of Fischlin's paradigm
Theory of Cryptography | 2013-03-18 | Paper |
New impossibility results for concurrent composition and a non-interactive completeness theorem for secure computation
Lecture Notes in Computer Science | 2012-09-25 | Paper |
