Publications
Filter & Search
Filter by Topic
▼ 2026
Separating Selective Opening Security from Standard Security, Assuming Indistinguishability Obfuscation
PKC 2026
Silent Threshold Cryptography from Pairings: Expressive Policies in the Plain Model
EUROCRYPT 2026
Threshold Batched Identity-Based Encryption from Pairings in the Plain Model
EUROCRYPT 2026
Simultaneous-Message and Succinct Secure Computation: Reusable and Multiparty Protocols
EUROCRYPT 2026
The Structured Generic-Group Model
EUROCRYPT 2026
Distributed Monotone-Policy Encryption for DNFs from Lattices
EUROCRYPT 2026
Succinct Garbled Circuits with Low-Depth Garbling Algorithms
EUROCRYPT 2026
▼ 2025
Succinct Computational Secret Sharing for Monotone Circuits
ASIACRYPT 2025
Succinct Witness Encryption for Batch Languages and Applications
ASIACRYPT 2025
Pairing-Based Aggregate Signatures Without Random Oracles
ASIACRYPT 2025
Pairing-Based Batch Arguments for NP with a Linear-Size CRS
ASIACRYPT 2025
A Hidden-Bits Approach to Statistical ZAPs from LWE
TCC 2025
The Pseudorandomness of Legendre Symbols Under the Quadratic-Residuosity Assumption
TCC 2025
Untelegraphable Encryption and its Applications
TCC 2025
Binary Codes for Computationally Bounded Errors Under Standard Crypto Assumptions
FOCS 2025
A Pure Indistinguishability Obfuscation Approach to Adaptively-Sound SNARGs for NP
CRYPTO 2025
How to Make Any Computational Secret Sharing Scheme Adaptively Secure
CRYPTO 2025
Registered ABE and Adaptively-Secure Broadcast Encryption from Succinct LWE
CRYPTO 2025
Unbounded Distributed Broadcast Encryption and Registered ABE from Succinct LWE
CRYPTO 2025
Multi-Authority Registered Attribute-Based Encryption
EUROCRYPT 2025
New Techniques for Preimage Sampling: Improved NIZKs and More from LWE
EUROCRYPT 2025
A Generic Approach to Adaptively-Secure Broadcast Encryption in the Plain Model
EUROCRYPT 2025
Accountable Multi-signatures with Constant Size Public Keys
PKC 2025
Adaptively-Secure Big-Key Identity-Based Encryption
PKC 2025
Monotone-Policy BARGs and More from BARGs and Quadratic Residuosity
PKC 2025
▼ 2024
Adaptively Secure Attribute-Based Encryption from Witness Encryption
TCC 2024
Batching Adaptively-Sound SNARGs for NP
TCC 2024
Monotone Policy BARGs from BARGs and Additively Homomorphic Encryption
TCC 2024
Batch Arguments to NIZKs from One-Way Functions
TCC 2024
Distributed Broadcast Encryption from Lattices
TCC 2024
Respire: High-Rate PIR for Databases with Small Records
ACM CCS 2024
Dot-Product Proofs and Their Applications
FOCS 2024
NIZKs with Maliciously Chosen CRS: Subversion Advice-ZK and Accountable Soundness
SCN 2024
Adaptive Security in SNARGs via iO and Lossy Functions
CRYPTO 2024
Reducing the CRS Size in Registered ABE Systems
CRYPTO 2024
The One-Wayness of Jacobi Signatures
CRYPTO 2024
Limits on the Power of Prime-Order Groups: Separating Q-Type from Static Assumptions
CRYPTO 2024
YPIR: High-Throughput Single-Server PIR with Silent Preprocessing
USENIX Security Symposium 2024
A New Approach for Non-Interactive Zero-Knowledge from Learning with Errors
STOC 2024
Adaptively-Sound Succinct Arguments for NP from Indistinguishability Obfuscation
STOC 2024
Succinct Functional Commitments for Circuits from k-Lin
EUROCRYPT 2024
Strong Batching for Non-Interactive Statistical Zero-Knowledge
EUROCRYPT 2024
Time-Lock Puzzles with Efficient Batch Solving
EUROCRYPT 2024
Dynamic Collusion Functional Encryption and Multi-Authority Attribute-Based Encryption
PKC 2024
▼ 2023
Lattice-Based Functional Commitments: Fast Verification and Cryptanalysis
ASIACRYPT 2023
Non-Interactive Anonymous Router with Quasi-Linear Router Computation
TCC 2023
Realizing Flexible Broadcast Encryption: How to Broadcast to a Public-Key Directory
ACM CCS 2023
How to Use (Plain) Witness Encryption: Registered ABE, Flexible Broadcast, and More
CRYPTO 2023
Non-Interactive Zero-Knowledge from Non-Interactive Batch Arguments
CRYPTO 2023
Security-Preserving Distributed Samplers: How to Generate Any CRS in One Round Without Random Oracles
CRYPTO 2023
Universal Amplification of KDM Security: From 1-Key Circular to Multi-Key KDM
CRYPTO 2023
Authenticated Private Information Retrieval
USENIX Security Symposium 2023
Succinct Vector, Polynomial, and Functional Commitments from Lattices
EUROCRYPT 2023
Registered Attribute-Based Encryption
EUROCRYPT 2023
On Non-Uniform Security for Black-Box Non-Interactive CCA Commitments
EUROCRYPT 2023
Fully Adaptive Decentralized Multi-Authority ABE
EUROCRYPT 2023
Non-Interactive Publicly-Verifiable Delegation of Committed Programs
PKC 2023
Decentralized Multi-Authority ABE for NC1 from Computational-BDH
Journal of Cryptology 2023
▼ 2022
Fully Succinct Batch Arguments for NP from Indistinguishability Obfuscation
TCC 2022
Multi-Authority ABE from Lattices Without Random Oracles
TCC 2022
Adaptive Multiparty NIKE
TCC 2022
How to Sample a Discrete Gaussian (and more) from a Random Oracle
TCC 2022
Batch Arguments for NP and More from Standard Bilinear Group Assumptions
CRYPTO 2022
A Performance Evaluation of Pairing-Based Broadcast Encryption Systems
ACNS 2022
Dynamic Collusion Bounded Functional Encryption from Identity-Based Encryption
EUROCRYPT 2022
Spiral: Fast, High-Rate Single-Server PIR via FHE Composition
IEEE Symposium on Security and Privacy 2022
Traceable PRFs: Full Collusion Resistance and Active Security
PKC 2022
▼ 2021
Beyond Software Watermarking: Traitor-Tracing for Pseudorandom Functions
ASIACRYPT 2021
Adaptive Security via Deletion in Attribute-Based Encryption: Solutions from Search Assumptions in Bilinear Groups
ASIACRYPT 2021
Bounded Collusion ABE for TMs from IBE
ASIACRYPT 2021
Shorter and Faster Post-Quantum Designated-Verifier zkSNARKs from Lattices
ACM CCS 2021
PPE Circuits for Rational Polynomials
ACM CCS 2021
Targeted Lossy Functions and Applications
CRYPTO 2021
Black-Box Non-Interactive Non-Malleable Commitments
EUROCRYPT 2021
Decentralized Multi-Authority ABE for DNFs from LWE
EUROCRYPT 2021
On the CCA Compatibility of Public-Key Infrastructure
PKC 2021
How to Use Indistinguishability Obfuscation: Deniable Encryption, and More
SIAM Journal of Computing 2021
Secure Multiparty Computation in the Bounded Storage Model
IMACC 2021
▼ 2020
On Perfect Correctness in (Lockable) Obfuscation
TCC 2020
New Techniques in Replica Encodings with Client Setup
TCC 2020
PPE Circuits: Formal Definition to Software Automation
ACM CCS 2020
A Practical Model for Collaborative Databases: Securely Mixing, Searching and Computing
ESORICS 2020
New Constructions of Hinting PRGs, OWFs with Encryption, and More
CRYPTO 2020
Chosen Ciphertext Security from Injective Trapdoor Functions
CRYPTO 2020
Verifiable Registration-Based Encryption
CRYPTO 2020
New Methods and Abstractions for RSA-Based Forward Secure Signatures
ACNS 2020
Collusion Resistant Traitor Tracing from Learning with Errors
SIAM Journal of Computing 2020
▼ 2019
Output Compression, MPC, and iO for Turing Machines
ASIACRYPT 2019
New Approaches to Traitor Tracing with Embedded Identities
TCC 2019
Are These Pairing Elements Correct?: Automated Verification and Applications
ACM CCS 2019
Watermarking Public-Key Cryptographic Primitives
CRYPTO 2019
Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption
CRYPTO 2019
ABE for DFA from k-Lin
CRYPTO 2019
Broadcast and Trace with N^epsilon Ciphertext Size from Standard Assumptions
CRYPTO 2019
Collusion Resistant Broadcast and Trace from Positional Witness Encryption
PKC 2019
Adaptively Secure Constrained Pseudorandom Functions
Financial Cryptography 2019
▼ 2018
Traitor-Tracing from LWE Made Simple and Attribute-Based
TCC 2018
Upgrading to Functional Encryption
TCC 2018
Impossibility of Simulation Secure Functional Encryption Even with Random Oracles
TCC 2018
Risky Traitor Tracing and New Differential Privacy Negative Results
CRYPTO 2018
Collusion Resistant Traitor Tracing from Learning with Errors
STOC 2018
Synchronized Aggregate Signatures from the RSA Assumption
EUROCRYPT 2018
▼ 2017
A Generic Approach to Constructing and Proving Verifiable Random Functions
TCC 2017
Overcoming Cryptographic Impossibility Results Using Blockchains
TCC 2017
Efficient, Constant-Round and Actively Secure MPC: Beyond the Three-Party Case
ACM CCS 2017
Lockable Obfuscation
FOCS 2017
Signature Schemes with Randomized Verification
ACNS 2017
Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption
EUROCRYPT 2017
Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
PKC 2017
Universal Samplers with Fast Verification
PKC 2017
▼ 2016
How to Generate and Use Universal Samplers
ASIACRYPT 2016
Semi-Adaptive Security and Bundling Functionalities Made Generic and Easy
TCC 2016
Circular Security Separations for Arbitrary Length Cycles from LWE
CRYPTO 2016
Deterministic Public-Key Encryption Under Continual Leakage
ACNS 2016
Constrained Pseudorandom Functions for Unconstrained Inputs
EUROCRYPT 2016
New Negative Results on Differing-Inputs Obfuscation
EUROCRYPT 2016
Time-Lock Puzzles from Randomized Encodings
ITCS 2016
Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
SIAM Journal of Computing 2016
Hiding Secrets in Software: A Cryptographic Approach to Program Obfuscation
Communications of the ACM 2016
▼ 2015
Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model
ASIACRYPT 2015
New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
ASIACRYPT 2015
New Circular Security Counterexamples from Decision Linear and Learning with Errors
ASIACRYPT 2015
Separations in Circular Security for Arbitrary Length Key Cycles
TCC 2015
Functional Encryption for Randomized Functionalities
TCC 2015
Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption
FOCS 2015
A Punctured Programming Approach to Adaptively Secure Functional Encryption
CRYPTO 2015
Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
STOC 2015
Universal Signature Aggregators
EUROCRYPT 2015
Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption
Financial Cryptography 2015
Computing on Authenticated Data
Journal of Cryptology 2015
Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys
SIAM Journal of Computing 2015
▼ 2014
Fully Secure and Fast Signing from Obfuscation
ACM CCS 2014
Relaxed Two-to-One Recoding Schemes
SCN 2014
Low Overhead Broadcast Encryption from Multilinear Maps
CRYPTO 2014
Witness Encryption from Instance Independent Assumptions
CRYPTO 2014
How to Use Indistinguishability Obfuscation: Deniable Encryption, and More
STOC 2014
Why Proving HIBE Systems Secure Is Difficult
EUROCRYPT 2014
Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation
EUROCRYPT 2014
Rethinking Verifiably Encrypted Signatures: A Gap in Functionality and Potential Solutions
CT-RSA 2014
Online/Offline Attribute-Based Encryption
PKC 2014
▼ 2013
Constrained Pseudorandom Functions and Their Applications
ASIACRYPT 2013
Practical Constructions and New Proof Methods for Large Universe Attribute-Based Encryption
ACM CCS 2013
Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits
FOCS 2013
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
CRYPTO 2013
Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys
CRYPTO 2013
Attribute-Based Encryption for Circuits from Multilinear Maps
CRYPTO 2013
Full Domain Hash from (Leveled) Multilinear Maps and Identity-Based Aggregate Signatures
CRYPTO 2013
Witness Encryption and its Applications
STOC 2013
Anon-Pass: Practical Anonymous Subscriptions
IEEE Symposium on Security and Privacy 2013
The k-BDH Assumption Family: Bilinear Map Cryptography from Progressively Weaker Assumptions
CT-RSA 2013
Attribute-Based Encryption with Fast Decryption
PKC 2013
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
Journal of Cryptology 2013
Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles
Journal of Cryptology 2013
Compact Proofs of Retrievability
Journal of Cryptology 2013
Reconstructing a fragmented face from a cryptographic identification protocol
WACV 2013
▼ 2012
Dual Form Signatures: An Approach for Proving Security from Static Assumptions
ASIACRYPT 2012
Computing on Authenticated Data
TCC 2012
Bounded-Collusion IBE from Key Homomorphism
TCC 2012
New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques
CRYPTO 2012
Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption
CRYPTO 2012
Functional Encryption for Regular Languages
CRYPTO 2012
Identity-Based (Lossy) Trapdoor Functions and Applications
EUROCRYPT 2012
Standard Security Does Not Imply Security against Selective-Opening
EUROCRYPT 2012
Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security
EUROCRYPT 2012
Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
EUROCRYPT 2012
Property Preserving Symmetric Encryption
EUROCRYPT 2012
Targeted Malleability: Homomorphic Encryption for Restricted Computations
ITCS 2012
Functional Encryption: A New Vision for Public-Key Cryptography
Communications of the ACM 2012
▼ 2011
Achieving Leakage Resilience through Dual System Encryption
TCC 2011
Identity-Based Encryption Secure against Selective Opening Attack
TCC 2011
Functional Encryption: Definitions and Challenges
TCC 2011
Storing Secrets on Continually Leaky Devices
FOCS 2011
Bi-Deniable Public-Key Encryption
CRYPTO 2011
Cloaking Malware with the Trusted Platform Module
USENIX Security Symposium 2011
Outsourcing the Decryption of ABE Ciphertexts
USENIX Security Symposium 2011
How to Leak on Key Updates
STOC 2011
Unbounded HIBE and Attribute-Based Encryption
EUROCRYPT 2011
Decentralizing Attribute-Based Encryption
EUROCRYPT 2011
Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
PKC 2011
Lossy Trapdoor Functions and Their Applications
SIAM Journal of Computing 2011
The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement
DISC 2011
▼ 2010
New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
TCC 2010
Building Efficient Fully Collusion-Resilient Traitor Tracing and Revocation Schemes
ACM CCS 2010
Practical Leakage-Resilient Identity-Based Encryption from Simple Assumptions
ACM CCS 2010
On the Insecurity of Parallel Repetition for Leakage Resilience
FOCS 2010
Shrinking the Keys of Discrete-Log-Type Lossy Trapdoor Functions
ACNS 2010
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
EUROCRYPT 2010
Constructing Verifiable Random Functions with Large Input Spaces
EUROCRYPT 2010
Revocation Systems with Very Small Private Keys
IEEE Symposium on Security and Privacy 2010
Defeating Vanish with Low-Cost Sybil Attacks Against Large DHTs
NDSS 2010
▼ 2009
Predicate Privacy in Encryption Systems
TCC 2009
Efficient Pseudorandom Functions from the Decisional Linear Assumption and Weaker Variants
ACM CCS 2009
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
CRYPTO 2009
Short and Stateless Signatures from the RSA Assumption
CRYPTO 2009
Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts)
EUROCRYPT 2009
Realizing Hash-and-Sign Signatures under Standard Assumptions
EUROCRYPT 2009
Signing a Linear Subspace: Signature Schemes for Network Coding
PKC 2009
▼ 2008
Compact Proofs of Retrievability
ASIACRYPT 2008
Black-Box Accountable Authority Identity-Based Encryption
ACM CCS 2008