| Publication | Date of Publication | Type |
|---|
| Witness semantic security | 2024-11-13 | Paper |
| Two-round concurrent 2PC from sub-exponential LWE | 2024-08-30 | Paper |
| Refuting the dream XOR lemma via ideal obfuscation and resettable MPC | 2024-06-25 | Paper |
| Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness | 2024-05-08 | Paper |
Indistinguishability obfuscation
International Congress of Mathematicians | 2024-03-20 | Paper |
Computational wiretap coding from indistinguishability obfuscation
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
Streaming functional encryption
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
Round-optimal black-box MPC in the plain model
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
Black-box reusable NISC with random oracles
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation
Journal of Cryptology | 2023-11-21 | Paper |
Non-interactive publicly-verifiable delegation of committed programs
Lecture Notes in Computer Science | 2023-11-16 | Paper |
Indistinguishability obfuscation from well-founded assumptions
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
scientific article; zbMATH DE number 7759458 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-02 | Paper |
Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-16 | Paper |
Round-optimal black-box secure computation from two-round malicious OT
Theory of Cryptography | 2023-08-14 | Paper |
Beyond the Csiszár-Korner bound: best-possible wiretap coding via obfuscation
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
| Secure MPC: laziness leads to GOD | 2023-03-29 | Paper |
| scientific article; zbMATH DE number 7650430 (Why is no real title available?) | 2023-02-03 | Paper |
| Amplifying the security of functional encryption, unconditionally | 2022-11-09 | Paper |
Homomorphic Encryption Standard
Protecting Privacy through Homomorphic Encryption | 2022-11-02 | Paper |
| Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) | 2022-08-30 | Paper |
| Round-optimal black-box protocol compilers | 2022-08-30 | Paper |
| On the round complexity of black-box secure MPC | 2022-04-22 | Paper |
| On pseudorandom encodings | 2022-03-23 | Paper |
| Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification | 2021-12-08 | Paper |
| Statistical ZAP arguments | 2021-12-01 | Paper |
| Combiners for functional encryption, unconditionally | 2021-12-01 | Paper |
How to use indistinguishability obfuscation: deniable encryption, and more
SIAM Journal on Computing | 2021-05-27 | Paper |
| Private circuits: a modular approach | 2020-06-30 | Paper |
| Output compression, MPC, and iO for Turing machines | 2020-05-20 | Paper |
| From FE combiners to secure MPC and back | 2020-04-30 | Paper |
| Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification | 2020-03-09 | Paper |
| Simultaneous amplification: the case of non-interactive zero-knowledge | 2020-03-09 | Paper |
| Cryptographic sensing | 2020-03-09 | Paper |
| Sum-of-squares meets program obfuscation, revisited | 2020-02-04 | Paper |
| How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\) | 2020-02-04 | Paper |
Succinct delegation for low-space non-deterministic computation
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| Upgrading to functional encryption | 2018-12-11 | Paper |
| Exploring crypto dark matter: new simple PRF candidates and their applications | 2018-12-06 | Paper |
Improved algorithms for optimal embeddings
ACM Transactions on Algorithms | 2018-11-05 | Paper |
| Promise zero knowledge and its applications to round optimal MPC | 2018-09-26 | Paper |
| Quasi-optimal SNARGs via linear multi-prover interactive proofs | 2018-07-17 | Paper |
| Statistical witness indistinguishability (and more) in two messages | 2018-07-17 | Paper |
| scientific article; zbMATH DE number 6866298 (Why is no real title available?) | 2018-05-03 | Paper |
| Preventing CLT attacks on obfuscation with linear overhead | 2018-02-23 | Paper |
| Non-interactive multiparty computation without correlated randomness | 2018-02-23 | Paper |
| Two-message witness indistinguishability and secure computation in the plain model from new assumptions | 2018-02-23 | Paper |
| Round optimal concurrent MPC via strong simulation | 2018-01-19 | Paper |
| Do distributed differentially-private protocols require oblivious transfer? | 2017-12-19 | Paper |
| Indistinguishability obfuscation for Turing machines: constant overhead and amortization | 2017-11-15 | Paper |
Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
Lecture Notes in Computer Science | 2017-06-23 | Paper |
Lattice-based SNARGs and their application to more efficient obfuscation
Lecture Notes in Computer Science | 2017-06-23 | Paper |
Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Robust transforming combiners from indistinguishability obfuscation to functional encryption
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Private interactive communication across an adversarial channel
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Efficient Coding for Interactive Communication
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Private Interactive Communication Across an Adversarial Channel
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
How to Generate and Use Universal Samplers
Advances in Cryptology – ASIACRYPT 2016 | 2017-01-06 | Paper |
Verifiable functional encryption
Advances in Cryptology – ASIACRYPT 2016 | 2017-01-06 | Paper |
Secure Obfuscation in a Weak Multilinear Map Model
Theory of Cryptography | 2016-12-22 | Paper |
Secure protocol transformations
Advances in Cryptology – CRYPTO 2016 | 2016-10-27 | Paper |
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
Advances in Cryptology – CRYPTO 2016 | 2016-10-27 | Paper |
Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
Advances in Cryptology – CRYPTO 2016 | 2016-10-27 | Paper |
Post-zeroizing obfuscation: new mathematical tools, and the case of evasive circuits
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
Secure computation from elastic noisy channels
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
All complete functionalities are reversible
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 |
Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
Advances in Cryptology -- ASIACRYPT 2015 | 2016-06-10 | Paper |
Multi-input functional encryption for unbounded arity functions
Advances in Cryptology -- ASIACRYPT 2015 | 2016-06-10 | Paper |
Functional Encryption for Turing Machines
Theory of Cryptography | 2016-03-23 | Paper |
Secure computation from leaky correlated randomness
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Cryptography with One-Way Communication
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Concurrent secure computation via non-black box simulation
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
Lecture Notes in Computer Science | 2015-12-10 | Paper |
A complete problem for statistical zero knowledge
Journal of the ACM | 2015-12-07 | Paper |
Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation
Advances in Cryptology - EUROCRYPT 2015 | 2015-09-30 | Paper |
Hosting services on an untrusted cloud
Advances in Cryptology - EUROCRYPT 2015 | 2015-09-30 | Paper |
On constant-round concurrent zero-knowledge from a knowledge assumption
Progress in Cryptology -- INDOCRYPT 2014 | 2015-09-10 | Paper |
On the practical security of inner product functional encryption
Lecture Notes in Computer Science | 2015-08-27 | Paper |
| Frugality in path auctions | 2015-08-03 | Paper |
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
Theory of Cryptography | 2015-07-06 | Paper |
Public-coin differing-inputs obfuscation and its applications
Theory of Cryptography | 2015-07-06 | Paper |
Obfuscation-based non-black-box simulation and four message concurrent zero knowledge for NP
Theory of Cryptography | 2015-07-06 | Paper |
Functional encryption for randomized functionalities
Theory of Cryptography | 2015-07-06 | Paper |
How to use indistinguishability obfuscation
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Circuits resilient to additive attacks with applications to secure computation
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Black-box separations for differentially private protocols
Lecture Notes in Computer Science | 2015-01-06 | Paper |
Query strategies for priced information (extended abstract)
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Witness encryption and its applications
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Efficient and Explicit Coding for Interactive Communication
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 |
Extracting correlations
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Secure computation using leaky tokens
Automata, Languages, and Programming | 2014-07-01 | Paper |
Protecting obfuscation against algebraic attacks
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Multi-input functional encryption
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Replacing a random oracle: full domain hash from indistinguishability obfuscation
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Obfuscation for evasive functions
Theory of Cryptography | 2014-02-18 | Paper |
Statistical concurrent non-malleable zero knowledge
Theory of Cryptography | 2014-02-18 | Paper |
On the (im)possibility of obfuscating programs
Journal of the ACM | 2014-02-17 | Paper |
New techniques for noninteractive zero-knowledge
Journal of the ACM | 2014-02-17 | Paper |
Discrete Gaussian leftover hash lemma over infinite domains
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
Zero knowledge LTCs and their applications
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Attribute-based encryption for circuits from multilinear maps
Advances in Cryptology – CRYPTO 2013 | 2013-09-17 | Paper |
Full domain hash from (leveled) multilinear maps and identity-based aggregate signatures
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
Secure computation against adaptive auxiliary information
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
Robust pseudorandom generators
Automata, Languages, and Programming | 2013-08-06 | Paper |
Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
Journal of Cryptology | 2013-06-27 | Paper |
Predicate encryption supporting disjunctions, polynomial equations, and inner products
Journal of Cryptology | 2013-06-27 | Paper |
Efficient noninteractive proof systems for bilinear groups
SIAM Journal on Computing | 2013-02-04 | Paper |
Dynamic credentials and ciphertext delegation for attribute-based encryption
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Adaptively secure multi-party computation with dishonest majority
Lecture Notes in Computer Science | 2012-09-25 | 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 |
Concurrently secure computation in constant rounds
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
On Efficient Zero-Knowledge PCPs
Theory of Cryptography | 2012-06-15 | Paper |
Resettable cryptography in constant rounds -- the case of zero knowledge
Lecture Notes in Computer Science | 2011-12-02 | Paper |
Round optimal blind signatures
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Constant-rate oblivious transfer from noisy channels
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Leakage-resilient zero knowledge
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Cryptography with tamperable and leaky memory
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Efficient non-interactive secure computation
Advances in Cryptology – EUROCRYPT 2011 | 2011-05-27 | Paper |
Functional encryption: definitions and challenges
Theory of Cryptography | 2011-05-19 | Paper |
Bringing people of different beliefs together to do UC
Theory of Cryptography | 2011-05-19 | Paper |
Fully secure accountable-authority identity-based encryption
Public Key Cryptography – PKC 2011 | 2011-03-15 | Paper |
On Invertible Sampling and Adaptive Security
Advances in Cryptology - ASIACRYPT 2010 | 2010-12-07 | Paper |
Interactive locking, zero-knowledge PCPs, and unconditional cryptography
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
New notions of security: achieving universal composability without trusted setup
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Batch codes and their applications
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Approximating the smallest grammar
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Universally composable two-party and multi-party secure computation
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Zero-knowledge proofs from secure multiparty computation
SIAM Journal on Computing | 2010-07-07 | Paper |
Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
Advances in Cryptology – EUROCRYPT 2010 | 2010-06-01 | Paper |
Founding Cryptography on Tamper-Proof Hardware Tokens
Theory of Cryptography | 2010-02-24 | Paper |
On complete primitives for fairness
Theory of Cryptography | 2010-02-24 | Paper |
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
Resettably Secure Computation
Advances in Cryptology - EUROCRYPT 2009 | 2009-05-12 | Paper |
| Attribute-based encryption | 2009-03-24 | Paper |
Secure Arithmetic Computation with No Honest Majority
Theory of Cryptography | 2009-03-03 | Paper |
Founding Cryptography on Oblivious Transfer – Efficiently
Lecture Notes in Computer Science | 2009-02-10 | Paper |
| Cryptography with constant computational overhead | 2009-01-05 | Paper |
| scientific article; zbMATH DE number 5485433 (Why is no real title available?) | 2009-01-05 | Paper |
The Smallest Grammar Problem
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Bounded Ciphertext Policy Attribute Based Encryption
Automata, Languages and Programming | 2008-08-19 | Paper |
Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions
Advances in Cryptology – ASIACRYPT 2007 | 2008-05-15 | Paper |
Fuzzy Identity-Based Encryption
Lecture Notes in Computer Science | 2008-05-06 | Paper |
New Constructions for UC Secure Computation Using Tamper-Proof Hardware
Advances in Cryptology – EUROCRYPT 2008 | 2008-04-15 | Paper |
Precise Concurrent Zero Knowledge
Advances in Cryptology – EUROCRYPT 2008 | 2008-04-15 | Paper |
Efficient Non-interactive Proof Systems for Bilinear Groups
Advances in Cryptology – EUROCRYPT 2008 | 2008-04-15 | Paper |
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
Advances in Cryptology – EUROCRYPT 2008 | 2008-04-15 | Paper |
Concurrent zero-knowledge
Journal of the ACM | 2008-01-14 | Paper |
Advances in Cryptology - CRYPTO 2003
Lecture Notes in Computer Science | 2007-11-28 | Paper |
Ring Signatures of Sub-linear Size Without Random Oracles
Automata, Languages and Programming | 2007-11-28 | Paper |
Private Locally Decodable Codes
Automata, Languages and Programming | 2007-11-28 | Paper |
Advances in Cryptology - EUROCRYPT 2004
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Perfect Non-interactive Zero Knowledge for NP
Advances in Cryptology - EUROCRYPT 2006 | 2007-09-24 | Paper |
Sequential Aggregate Signatures and Multisignatures Without Random Oracles
Advances in Cryptology - EUROCRYPT 2006 | 2007-09-24 | Paper |
Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
Advances in Cryptology - EUROCRYPT 2006 | 2007-09-24 | Paper |
Private Circuits II: Keeping Secrets in Tamperable Circuits
Advances in Cryptology - EUROCRYPT 2006 | 2007-09-24 | Paper |
Non-interactive Zaps and New Techniques for NIZK
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Progress in Cryptology - INDOCRYPT 2004
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Minimizing Wirelength in Zero and Bounded Skew Clock Trees
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
| scientific article; zbMATH DE number 1775426 (Why is no real title available?) | 2004-01-27 | Paper |
| scientific article; zbMATH DE number 1842511 (Why is no real title available?) | 2002-12-08 | Paper |
| scientific article; zbMATH DE number 1842483 (Why is no real title available?) | 2002-12-08 | Paper |
| scientific article; zbMATH DE number 1440890 (Why is no real title available?) | 2002-12-02 | Paper |
| scientific article; zbMATH DE number 1775425 (Why is no real title available?) | 2002-09-17 | Paper |
| scientific article; zbMATH DE number 1722684 (Why is no real title available?) | 2002-03-21 | Paper |
| scientific article; zbMATH DE number 1418312 (Why is no real title available?) | 2000-08-27 | Paper |
| scientific article; zbMATH DE number 1418315 (Why is no real title available?) | 2000-08-27 | Paper |
| scientific article; zbMATH DE number 1418320 (Why is no real title available?) | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1302864 (Why is no real title available?) | 2000-03-07 | Paper |
Pushing disks together -- The continuous-motion case
Discrete & Computational Geometry | 1999-10-06 | Paper |
| scientific article; zbMATH DE number 1305406 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1302853 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1256726 (Why is no real title available?) | 1999-03-01 | Paper |
| scientific article; zbMATH DE number 1241395 (Why is no real title available?) | 1999-01-17 | Paper |
