| Publication | Date of Publication | Type |
|---|
Policy compliant secure messaging
| 2026-03-31 | Paper |
How to prove statements obliviously?
| 2025-01-10 | Paper |
Threshold encryption with silent setup
| 2024-12-13 | Paper |
Scalable multiparty computation from non-linear secret sharing
| 2024-12-13 | Paper |
Laconic branching programs from the Diffie-Hellman assumption
| 2024-11-12 | Paper |
Factoring and pairings are not necessary for iO: circular-secure LWE suffices
| 2024-06-24 | Paper |
Correlation intractability and SNARGs from sub-exponential DDH
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
Cryptography with weights: MPC, encryption and signatures
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
End-to-end secure messaging with traceability only for illegal content
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Credibility in private set membership
Lecture Notes in Computer Science | 2023-11-16 | Paper |
On the worst-case inefficiency of CGKA
Theory of Cryptography | 2023-08-14 | Paper |
IBE with incompressible master secret and small identity secrets
Theory of Cryptography | 2023-08-14 | Paper |
Candidate iO from homomorphic encryption schemes
Journal of Cryptology | 2023-07-26 | Paper |
A more complete analysis of the signal double ratchet algorithm
Advances in Cryptology – CRYPTO 2022 | 2023-06-12 | Paper |
How to build a trapdoor function from an encryption scheme
Lecture Notes in Computer Science | 2023-05-12 | Paper |
Two-round Multiparty Secure Computation from Minimal Assumptions
Journal of the ACM | 2023-04-27 | Paper |
Laconic private set intersection and applications
| 2023-04-13 | Paper |
Amortizing rate-1 OT and applications to PIR and PSI
| 2023-04-13 | Paper |
Ad Hoc Multi-Input Functional Encryption.
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650419 (Why is no real title available?)
| 2023-02-03 | Paper |
Tight verifiable delay functions
| 2022-12-16 | Paper |
Black-box constructions of bounded-concurrent secure computation
| 2022-12-16 | Paper |
Identity-based Encryption from the Diffie-Hellman Assumption
Journal of the ACM | 2022-12-08 | Paper |
Master-key KDM-secure IBE from pairings
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Reusable two-round MPC from LPN
Public-Key Cryptography – PKC 2022 | 2022-07-08 | Paper |
Compact ring signatures from learning with errors
| 2022-03-31 | Paper |
Two-round oblivious transfer from CDH or LPN
| 2022-03-23 | Paper |
Reusable two-round MPC from DDH
| 2022-03-23 | Paper |
Formalizing data deletion in the context of the right to be forgotten
| 2022-03-23 | Paper |
Constant ciphertext-rate non-committing encryption from standard assumptions
| 2021-12-01 | Paper |
Candidate iO from homomorphic encryption schemes
| 2021-12-01 | Paper |
Efficient range-trapdoor functions and applications: rate-1 OT and more
| 2021-12-01 | Paper |
FHE-based bootstrapping of designated-prover NIZK
| 2021-12-01 | Paper |
Two-round multiparty secure computation minimizing public key operations
| 2020-06-30 | Paper |
Limits on the power of garbling techniques for public-key encryption
| 2020-06-30 | Paper |
Adaptive garbled RAM from laconic oblivious transfer
| 2020-06-30 | Paper |
On the round complexity of OT extension
| 2020-06-30 | Paper |
Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
| 2020-05-27 | Paper |
The broadcast message complexity of secure multiparty computation
| 2020-05-20 | Paper |
Rate-1 trapdoor functions from the Diffie-Hellman problem
| 2020-05-11 | Paper |
Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
| 2020-04-30 | Paper |
Trapdoor hash functions and their applications
| 2020-03-09 | Paper |
New techniques for efficient trapdoor functions and applications
| 2020-02-04 | Paper |
Registration-based encryption from standard assumptions
| 2020-01-28 | Paper |
Obfuscation from low noise multilinear maps
| 2019-03-29 | Paper |
Two-round MPC: information-theoretic and black-box
| 2018-12-11 | Paper |
Registration-based encryption: removing private-key generator from IBE
| 2018-12-11 | Paper |
A simple construction of iO for Turing machines
| 2018-12-06 | Paper |
Trapdoor functions from the computational Diffie-Hellman assumption
| 2018-09-26 | Paper |
Adaptively secure garbling with near optimal online complexity
| 2018-07-09 | Paper |
Two-round multiparty secure computation from minimal assumptions
| 2018-07-09 | Paper |
A new approach to black-box concurrent secure computation
| 2018-07-09 | Paper |
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
SIAM Journal on Computing | 2018-07-04 | Paper |
New constructions of identity-based and key-dependent message secure encryption schemes
| 2018-05-16 | Paper |
Two-message witness indistinguishability and secure computation in the plain model from new assumptions
| 2018-02-23 | Paper |
From selective IBE to full IBE and selective HIBE
| 2018-01-19 | Paper |
When does functional encryption imply obfuscation?
| 2018-01-19 | Paper |
On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
Algorithmica | 2018-01-05 | Paper |
Laconic oblivious transfer and its applications
| 2017-11-15 | Paper |
Incremental program obfuscation
| 2017-11-15 | Paper |
Identity-based encryption from the Diffie-Hellman assumption
| 2017-11-03 | Paper |
Lower bounds on obfuscation from all-or-nothing encryption primitives
| 2017-11-03 | Paper |
Breaking the sub-exponential barrier in obfustopia
Lecture Notes in Computer Science | 2017-06-23 | Paper |
On the exact round complexity of self-composable two-party computation
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Secure Obfuscation in a Weak Multilinear Map Model
Theory of Cryptography | 2016-12-22 | Paper |
Single-key to multi-key functional encryption with polynomial loss
Theory of Cryptography | 2016-12-22 | Paper |
Secure multiparty RAM computation in constant rounds
Theory of Cryptography | 2016-12-21 | Paper |
\textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
Advances in Cryptology – CRYPTO 2016 | 2016-10-27 | Paper |
The Exact Round Complexity of Secure Computation
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
Candidate indistinguishability obfuscation and functional encryption for all circuits
SIAM Journal on Computing | 2016-07-04 | Paper |
Functional encryption without obfuscation
Theory of Cryptography | 2016-04-08 | Paper |
Cryptography with One-Way Communication
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Balancing output length and query bound in hardness preserving constructions of pseudorandom functions
Progress in Cryptology -- INDOCRYPT 2014 | 2015-09-10 | Paper |
Succinct randomized encodings and their applications
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Garbled RAM from one-way functions
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
Theory of Cryptography | 2015-07-06 | Paper |
Witness encryption and its applications
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Protecting obfuscation against algebraic attacks
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Efficient Round Optimal Blind Signatures
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Cross-domain secure computation
Public-Key Cryptography – PKC 2014 | 2014-03-25 | Paper |
Two-round secure MPC from indistinguishability obfuscation
Theory of Cryptography | 2014-02-18 | Paper |
Attribute-based encryption for circuits from multilinear maps
Advances in Cryptology – CRYPTO 2013 | 2013-09-17 | Paper |
Secure computation against adaptive auxiliary information
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
Candidate Multilinear Maps from Ideal Lattices
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 |
Why ``Fiat-Shamir for proofs lacks a proof
Theory of Cryptography | 2013-03-18 | Paper |
Adaptively secure multi-party computation with dishonest majority
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Impossibility results for static input secure computation
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Concurrently secure computation in constant rounds
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
Resettable statistical zero knowledge
Theory of Cryptography | 2012-06-15 | Paper |
Leakage-resilient zero knowledge
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Round optimal blind signatures
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Bringing people of different beliefs together to do UC
Theory of Cryptography | 2011-05-19 | Paper |
Improved Bounds on Security Reductions for Discrete Log Based Signatures
Lecture Notes in Computer Science | 2009-02-10 | Paper |
