Brent Waters

Orcid: 0009-0008-9718-8623

Affiliations:
  • University of Texas at Austin, USA


According to our database1, Brent Waters authored at least 184 papers between 2003 and 2024.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2021, "For contributions to cryptography".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Adaptive Security in SNARGs via iO and Lossy Functions.
IACR Cryptol. ePrint Arch., 2024

Adaptively-Sound Succinct Arguments for NP from Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2024

A New Approach for Non-Interactive Zero-Knowledge from Learning with Errors.
IACR Cryptol. ePrint Arch., 2024

Reducing the CRS Size in Registered ABE Systems.
IACR Cryptol. ePrint Arch., 2024

NIZKs with Maliciously Chosen CRS: Subversion Advice-ZK and Accountable Soundness.
IACR Cryptol. ePrint Arch., 2024

2023
Decentralized Multi-authority ABE for sfNC<sup>1</sup> from BDH.
J. Cryptol., April, 2023

Universal Amplification of KDM Security: From 1-Key Circular to Multi-Key KDM.
IACR Cryptol. ePrint Arch., 2023

Monotone Policy BARGs from BARGs and Additively Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2023

Realizing Flexible Broadcast Encryption: How to Broadcast to a Public-Key Directory.
IACR Cryptol. ePrint Arch., 2023

How to Use (Plain) Witness Encryption: Registered ABE, Flexible Broadcast, and More.
IACR Cryptol. ePrint Arch., 2023

Batch Arguments to NIZKs from One-Way Functions.
IACR Cryptol. ePrint Arch., 2023

Accountable Multi-Signatures with Constant Size Public Keys.
IACR Cryptol. ePrint Arch., 2023

Security-Preserving Distributed Samplers: How to Generate any CRS in One Round without Random Oracles.
IACR Cryptol. ePrint Arch., 2023

Non-Interactive Anonymous Router with Quasi-Linear Router Computation.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

2022
Batch Arguments for NP and More from Standard Bilinear Group Assumptions.
IACR Cryptol. ePrint Arch., 2022

Multi-Authority ABE from Lattices without Random Oracles.
IACR Cryptol. ePrint Arch., 2022

How to Sample a Discrete Gaussian (and more) from a Random Oracle.
IACR Cryptol. ePrint Arch., 2022

Adaptive Multiparty NIKE.
IACR Cryptol. ePrint Arch., 2022

Registered Attribute-Based Encryption.
IACR Cryptol. ePrint Arch., 2022

Non-Interactive Publicly-Verifiable Delegation of Committed Programs.
IACR Cryptol. ePrint Arch., 2022

Fully Succinct Batch Arguments for NP from Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2022

Fully Adaptive Decentralized Multi-Authority ABE.
IACR Cryptol. ePrint Arch., 2022

On Non-uniform Security for Black-box Non-Interactive CCA Commitments.
IACR Cryptol. ePrint Arch., 2022

Fully Succinct Batch Arguments for sfNP from Indistinguishability Obfuscation.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Batch Arguments for sfNP and More from Standard Bilinear Group Assumptions.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
Targeted Lossy Functions and Applications.
IACR Cryptol. ePrint Arch., 2021

On the CCA Compatibility of Public-Key Infrastructure.
IACR Cryptol. ePrint Arch., 2021

Bounded Collusion ABE for TMs from IBE.
IACR Cryptol. ePrint Arch., 2021

Adaptive Security via Deletion in Attribute-Based Encryption: Solutions from Search Assumptions in Bilinear Groups.
IACR Cryptol. ePrint Arch., 2021

Dynamic Collusion Bounded Functional Encryption from Identity-Based Encryption.
IACR Cryptol. ePrint Arch., 2021

Decentralized Multi-Authority ABE for NC^1 from Computational-BDH.
IACR Cryptol. ePrint Arch., 2021

2020
New Methods and Abstractions for RSA-Based Forward Secure Signatures.
IACR Cryptol. ePrint Arch., 2020

Chosen Ciphertext Security from Injective Trapdoor Functions.
IACR Cryptol. ePrint Arch., 2020

Beyond Software Watermarking: Traitor-Tracing for Pseudorandom Functions.
IACR Cryptol. ePrint Arch., 2020

New Techniques in Replica Encodings with Client Setup.
IACR Cryptol. ePrint Arch., 2020

Black-Box Non-Interactive Non-Malleable Commitments.
IACR Cryptol. ePrint Arch., 2020

Decentralized Multi-Authority ABE for DNFs from LWE.
IACR Cryptol. ePrint Arch., 2020

PPE Circuits: Formal Definition to Software Automation.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019
New Constructions of Hinting PRGs, OWFs with Encryption, and more.
IACR Cryptol. ePrint Arch., 2019

Collusion Resistant Broadcast and Trace from Positional Witness Encryption.
IACR Cryptol. ePrint Arch., 2019

Broadcast and Trace with N^epsilon Ciphertext Size from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2019

New Approaches to Traitor Tracing with Embedded Identities.
IACR Cryptol. ePrint Arch., 2019

On Perfect Correctness in (Lockable) Obfuscation.
IACR Cryptol. ePrint Arch., 2019

Watermarking Public-Key Cryptographic Primitives.
IACR Cryptol. ePrint Arch., 2019

ABE for DFA from k-Lin.
IACR Cryptol. ePrint Arch., 2019

Broadcast and Trace with N^ε Ciphertext Size from Standard Assumptions.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption.
IACR Cryptol. ePrint Arch., 2018

Synchronized Aggregate Signatures from the RSA Assumption.
IACR Cryptol. ePrint Arch., 2018

Collusion Resistant Traitor Tracing from Learning with Errors.
IACR Cryptol. ePrint Arch., 2018

Traitor-Tracing from LWE Made Simple and Attribute-Based.
IACR Cryptol. ePrint Arch., 2018

Upgrading to Functional Encryption.
IACR Cryptol. ePrint Arch., 2018

Output Compression, MPC, and iO for Turing Machines.
IACR Cryptol. ePrint Arch., 2018

2017
Universal Samplers with Fast Verification.
IACR Cryptol. ePrint Arch., 2017

Lockable Obfuscation.
IACR Cryptol. ePrint Arch., 2017

Separating IND-CPA and Circular Security for Unbounded Length Key Cycles.
IACR Cryptol. ePrint Arch., 2017

Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption.
IACR Cryptol. ePrint Arch., 2017

Risky Traitor Tracing and New Differential Privacy Negative Results.
IACR Cryptol. ePrint Arch., 2017

A Generic Approach to Constructing and Proving Verifiable Random Functions.
IACR Cryptol. ePrint Arch., 2017

Signature Schemes with Randomized Verification.
Proceedings of the Applied Cryptography and Network Security, 2017

2016
Circular Security Counterexamples for Arbitrary Length Cycles from LWE.
IACR Cryptol. ePrint Arch., 2016

Semi-Adaptive Security and Bundling Functionalities Made Generic and Easy.
IACR Cryptol. ePrint Arch., 2016

Constrained Pseudorandom Functions for Unconstrained Inputs.
IACR Cryptol. ePrint Arch., 2016

New Negative Results on Differing-Inputs Obfuscation.
IACR Cryptol. ePrint Arch., 2016

Impossibility of Simulation Secure Functional Encryption Even with Random Oracles.
IACR Cryptol. ePrint Arch., 2016

Hiding secrets in software: a cryptographic approach to program obfuscation.
Commun. ACM, 2016

Circular Security Separations for Arbitrary Length Cycles from LWE.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

How to Generate and Use Universal Samplers.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015
Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys.
SIAM J. Comput., 2015

Computing on Authenticated Data.
J. Cryptol., 2015

Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption.
IACR Cryptol. ePrint Arch., 2015

New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators.
IACR Cryptol. ePrint Arch., 2015

Time-Lock Puzzles from Randomized Encodings.
IACR Cryptol. ePrint Arch., 2015

New Circular Security Counterexamples from Decision Linear and Learning with Errors.
IACR Cryptol. ePrint Arch., 2015

2014
Anon-Pass: Practical Anonymous Subscriptions.
IEEE Secur. Priv., 2014

A Punctured Programming Approach to Adaptively Secure Functional Encryption.
IACR Cryptol. ePrint Arch., 2014

Fully Secure and Fast Signing from Obfuscation.
IACR Cryptol. ePrint Arch., 2014

Relaxed Two-to-one Recoding Schemes.
IACR Cryptol. ePrint Arch., 2014

Deterministic Public-Key Encryption under Continual Leakage.
IACR Cryptol. ePrint Arch., 2014

Indistinguishability Obfuscation for Turing Machines with Unbounded Memory.
IACR Cryptol. ePrint Arch., 2014

How to Generate and use Universal Parameters.
IACR Cryptol. ePrint Arch., 2014

Online/Offline Attribute-Based Encryption.
IACR Cryptol. ePrint Arch., 2014

Universal Signature Aggregators.
IACR Cryptol. ePrint Arch., 2014

Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model.
IACR Cryptol. ePrint Arch., 2014

Adaptively Secure Constrained Pseudorandom Functions.
IACR Cryptol. ePrint Arch., 2014

Witness Encryption from Instance Independent Assumptions.
IACR Cryptol. ePrint Arch., 2014

Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption.
IACR Cryptol. ePrint Arch., 2014

Low Overhead Broadcast Encryption from Multilinear Maps.
IACR Cryptol. ePrint Arch., 2014

Rethinking Verifiably Encrypted Signatures: A Gap in Functionality and Potential Solutions.
Proceedings of the Topics in Cryptology - CT-RSA 2014, 2014

2013
Compact Proofs of Retrievability.
J. Cryptol., 2013

Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles.
J. Cryptol., 2013

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products.
J. Cryptol., 2013

How to Use Indistinguishability Obfuscation: Deniable Encryption, and More.
IACR Cryptol. ePrint Arch., 2013

Why Proving HIBE Systems Secure is Difficult.
IACR Cryptol. ePrint Arch., 2013

Separations in Circular Security for Arbitrary Length Key Cycles.
IACR Cryptol. ePrint Arch., 2013

Attribute-Based Encryption with Fast Decryption.
IACR Cryptol. ePrint Arch., 2013

Replacing a Random Oracle: Full Domain Hash From Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2013

Full Domain Hash from (Leveled) Multilinear Maps and Identity-Based Aggregate Signatures.
IACR Cryptol. ePrint Arch., 2013

Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based.
IACR Cryptol. ePrint Arch., 2013

Witness Encryption and its Applications.
IACR Cryptol. ePrint Arch., 2013

Attribute-Based Encryption for Circuits from Multilinear Maps.
IACR Cryptol. ePrint Arch., 2013

Candidate Indistinguishability Obfuscation and Functional Encryption for all circuits.
IACR Cryptol. ePrint Arch., 2013

Constrained Pseudorandom Functions and Their Applications.
IACR Cryptol. ePrint Arch., 2013

Reconstructing a fragmented face from a cryptographic identification protocol.
Proceedings of the 2013 IEEE Workshop on Applications of Computer Vision, 2013

Functional Encryption: Origins and Recent Developments.
Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013

Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Practical constructions and new proof methods for large universe attribute-based encryption.
Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

2012
Functional Encryption for Regular Languages.
IACR Cryptol. ePrint Arch., 2012

Attribute-Based Encryption for Circuits from Multilinear Maps.
IACR Cryptol. ePrint Arch., 2012

Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption.
IACR Cryptol. ePrint Arch., 2012

New Constructions and Proof Methods for Large Universe Attribute-Based Encryption.
IACR Cryptol. ePrint Arch., 2012

New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques.
IACR Cryptol. ePrint Arch., 2012

Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security.
IACR Cryptol. ePrint Arch., 2012

Dual Form Signatures: An Approach for Proving Security from Static Assumptions.
IACR Cryptol. ePrint Arch., 2012

The k-BDH Assumption Family: Bilinear Map Cryptography from Progressively Weaker Assumptions.
IACR Cryptol. ePrint Arch., 2012

Encoding Functions with Constant Online Rate or How to Compress Keys in Garbled Circuits.
IACR Cryptol. ePrint Arch., 2012

Functional encryption: a new vision for public-key cryptography.
Commun. ACM, 2012

2011
Bi-Deniable Public-Key Encryption.
IACR Cryptol. ePrint Arch., 2011

Unbounded HIBE and Attribute-Based Encryption.
IACR Cryptol. ePrint Arch., 2011

Storing Secrets on Continually Leaky Devices.
IACR Cryptol. ePrint Arch., 2011

Targeted Malleability: Homomorphic Encryption for Restricted Computations.
IACR Cryptol. ePrint Arch., 2011

Identity-Based (Lossy) Trapdoor Functions and Applications.
IACR Cryptol. ePrint Arch., 2011

Standard Security Does Not Imply Security Against Selective-Opening.
IACR Cryptol. ePrint Arch., 2011

Outsourcing the Decryption of ABE Ciphertexts.
Proceedings of the 20th USENIX Security Symposium, 2011

Cloaking Malware with the Trusted Platform Module.
Proceedings of the 20th USENIX Security Symposium, 2011

2010
Secure attribute-based systems.
J. Comput. Secur., 2010

On the Insecurity of Parallel Repetition for Leakage Resilience.
IACR Cryptol. ePrint Arch., 2010

Decentralizing Attribute-Based Encryption.
IACR Cryptol. ePrint Arch., 2010

Achieving Leakage Resilience Through Dual System Encryption.
IACR Cryptol. ePrint Arch., 2010

Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption.
IACR Cryptol. ePrint Arch., 2010

How to Leak on Key Updates.
IACR Cryptol. ePrint Arch., 2010

Constructing Verifiable Random Functions with Large Input Spaces.
IACR Cryptol. ePrint Arch., 2010

Functional Encryption: Definitions and Challenges.
IACR Cryptol. ePrint Arch., 2010

Identity-Based Encryption Secure against Selective Opening Attack.
IACR Cryptol. ePrint Arch., 2010

Defeating Vanish with Low-Cost Sybil Attacks Against Large DHTs.
Proceedings of the Network and Distributed System Security Symposium, 2010

Practical leakage-resilient identity-based encryption from simple assumptions.
Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010

Shrinking the Keys of Discrete-Log-Type Lossy Trapdoor Functions.
Proceedings of the Applied Cryptography and Network Security, 8th International Conference, 2010

2009
Attribute-Based Encryption.
Proceedings of the Identity-Based Cryptography, 2009

New Techniques for Private Stream Searching.
ACM Trans. Inf. Syst. Secur., 2009

Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions.
IACR Cryptol. ePrint Arch., 2009

Efficient Pseudorandom Functions From the Decisional Linear Assumption and Weaker Variants.
IACR Cryptol. ePrint Arch., 2009

New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts.
IACR Cryptol. ePrint Arch., 2009

Short and Stateless Signatures from the RSA Assumption.
IACR Cryptol. ePrint Arch., 2009

Realizing Hash-and-Sign Signatures under Standard Assumptions.
IACR Cryptol. ePrint Arch., 2009

Building Efficient Fully Collusion-Resilient Traitor Tracing and Revocation Schemes.
IACR Cryptol. ePrint Arch., 2009

Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts).
Proceedings of the Advances in Cryptology, 2009

2008
Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization.
IACR Cryptol. ePrint Arch., 2008

Delegating Capabilities in Predicate Encryption Systems.
IACR Cryptol. ePrint Arch., 2008

Predicate Privacy in Encryption Systems.
IACR Cryptol. ePrint Arch., 2008

Revocation Systems with Very Small Private Keys.
IACR Cryptol. ePrint Arch., 2008

Adaptive Security in Broadcast Encryption Systems.
IACR Cryptol. ePrint Arch., 2008

Signing a Linear Subspace: Signature Schemes for Network Coding.
IACR Cryptol. ePrint Arch., 2008

Analysis-Resistant Malware.
Proceedings of the Network and Distributed System Security Symposium, 2008

On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

Black-box accountable authority identity-based encryption.
Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008

2007
A Framework for Efficient and Composable Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2007

Attribute-Based Encryption with Non-Monotonic Access Structures.
IACR Cryptol. ePrint Arch., 2007

Lossy Trapdoor Functions and Their Applications.
Electron. Colloquium Comput. Complex., 2007

Ciphertext-Policy Attribute-Based Encryption.
Proceedings of the 2007 IEEE Symposium on Security and Privacy (S&P 2007), 2007

Full-Domain Subgroup Hiding and Constant-Size Group Signatures.
Proceedings of the Public Key Cryptography, 2007

Cryptographic Methods for Storing Ballots on a Voting Machine.
Proceedings of the Network and Distributed System Security Symposium, 2007

Harvesting verifiable challenges from oblivious online sources.
Proceedings of the 2007 ACM Conference on Computer and Communications Security, 2007

2006
Efficient Ring Signatures without Random Oracles.
IACR Cryptol. ePrint Arch., 2006

Sequential Aggregate Signatures and Multisignatures without Random Oracles.
IACR Cryptol. ePrint Arch., 2006

Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data.
IACR Cryptol. ePrint Arch., 2006

Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles).
IACR Cryptol. ePrint Arch., 2006

Forward-Secure Signatures with Untrusted Update.
IACR Cryptol. ePrint Arch., 2006

A Fully Collusion Resistant Broadcast, Trace, and Revoke System.
IACR Cryptol. ePrint Arch., 2006

Conjunctive, Subset, and Range Queries on Encrypted Data.
IACR Cryptol. ePrint Arch., 2006

Fully Collusion Resistant Traitor Tracing.
IACR Cryptol. ePrint Arch., 2006

New Constructions and Practical Applications for Private Stream Searching (Extended Abstract).
Proceedings of the 2006 IEEE Symposium on Security and Privacy (S&P 2006), 2006

Strongly Unforgeable Signatures Based on Computational Diffie-Hellman.
Proceedings of the Public Key Cryptography, 2006

Privacy in Encrypted Content Distribution Using Private Broadcast Encryption.
Proceedings of the Financial Cryptography and Data Security, 2006

Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys.
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

2005
Compact Group Signatures Without Random Oracles.
IACR Cryptol. ePrint Arch., 2005

Direct Chosen Ciphertext Security from Identity-Based Techniques.
IACR Cryptol. ePrint Arch., 2005

Collusion Resistant Broadcast Encryption With Short Ciphertexts and Private Keys.
IACR Cryptol. ePrint Arch., 2005

A convenient method for securely managing passwords.
Proceedings of the 14th international conference on World Wide Web, 2005

2004
Efficient Identity-Based Encryption Without Random Oracles.
IACR Cryptol. ePrint Arch., 2004

Fuzzy Identity Based Encryption.
IACR Cryptol. ePrint Arch., 2004

Privacy management for portable recording devices.
Proceedings of the 2004 ACM Workshop on Privacy in the Electronic Society, 2004

Building an Encrypted and Searchable Audit Log.
Proceedings of the Network and Distributed System Security Symposium, 2004

New client puzzle outsourcing techniques for DoS resistance.
Proceedings of the 11th ACM Conference on Computer and Communications Security, 2004

Secure Conjunctive Keyword Search over Encrypted Data.
Proceedings of the Applied Cryptography and Network Security, 2004

2003
Receiver anonymity via incomparable public keys.
Proceedings of the 10th ACM Conference on Computer and Communications Security, 2003


  Loading...