Brent R. Waters
#109,664
Most Influential Person Now
Brent R. Waters's AcademicInfluence.com Rankings
Brent R. Waterscomputer-science Degrees
Computer Science
#4101
World Rank
#4317
Historical Rank
Database
#1337
World Rank
#1409
Historical Rank

Download Badge
Computer Science
Brent R. Waters's Degrees
- PhD Computer Science Stanford University
- Masters Computer Science Stanford University
- Bachelors Computer Science University of Texas at Austin
Similar Degrees You Can Earn
Why Is Brent R. Waters Influential?
(Suggest an Edit or Addition)Brent R. Waters's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Attribute-based encryption for fine-grained access control of encrypted data (2006) (5311)
- Fuzzy Identity-Based Encryption (2005) (4421)
- Ciphertext-Policy Attribute-Based Encryption (2007) (4173)
- Compact Proofs of Retrievability (2008) (2006)
- Efficient Identity-Based Encryption Without Random Oracles (2005) (2001)
- Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization (2011) (1976)
- Conjunctive, Subset, and Range Queries on Encrypted Data (2007) (1502)
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption (2010) (1333)
- Decentralizing Attribute-Based Encryption (2011) (1193)
- Attribute-based encryption with non-monotonic access structures (2007) (1192)
- Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits (2013) (1185)
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based (2013) (1175)
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products (2008) (1166)
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys (2005) (1074)
- Secure Conjunctive Keyword Search over Encrypted Data (2004) (862)
- Functional Encryption: Definitions and Challenges (2011) (862)
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions (2009) (852)
- Outsourcing the Decryption of ABE Ciphertexts (2011) (730)
- A Framework for Efficient and Composable Oblivious Transfer (2008) (660)
- Lossy trapdoor functions and their applications (2008) (612)
- How to use indistinguishability obfuscation: deniable encryption, and more (2014) (605)
- Secure attribute-based systems (2006) (542)
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles) (2006) (497)
- Predicate Privacy in Encryption Systems (2009) (446)
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts (2010) (427)
- Building an Encrypted and Searchable Audit Log (2004) (411)
- Constrained Pseudorandom Functions and Their Applications (2013) (357)
- New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques (2012) (356)
- Practical constructions and new proof methods for large universe attribute-based encryption (2013) (349)
- Signing a Linear Subspace: Signature Schemes for Network Coding (2009) (332)
- Attribute-Based Encryption for Circuits from Multilinear Maps (2012) (327)
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys (2006) (324)
- Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption (2012) (319)
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles (2006) (319)
- Unbounded HIBE and Attribute-Based Encryption (2011) (308)
- Direct chosen ciphertext security from identity-based techniques (2005) (292)
- Witness encryption and its applications (2013) (281)
- Revocation Systems with Very Small Private Keys (2010) (281)
- Compact Group Signatures Without Random Oracles (2006) (271)
- Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts) (2009) (268)
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures (2007) (251)
- A convenient method for securely managing passwords (2005) (239)
- Attribute-Based Encryption with Fast Decryption (2013) (234)
- Online/Offline Attribute-Based Encryption (2014) (224)
- A fully collusion resistant broadcast, trace, and revoke system (2006) (219)
- Strongly Unforgeable Signatures Based on Computational Diffie-Hellman (2006) (215)
- New client puzzle outsourcing techniques for DoS resistance (2004) (192)
- Practical leakage-resilient identity-based encryption from simple assumptions (2010) (191)
- Delegating Capabilities in Predicate Encryption Systems (2008) (175)
- Achieving Leakage Resilience through Dual System Encryption (2011) (171)
- Functional Encryption for Regular Languages (2012) (163)
- Efficient Statically-Secure Large-Universe Multi-Authority Attribute-Based Encryption (2015) (162)
- Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption (2015) (156)
- Computing on Authenticated Data (2012) (153)
- Efficient Ring Signatures Without Random Oracles (2007) (150)
- A Punctured Programming Approach to Adaptively Secure Functional Encryption (2015) (149)
- Privacy in Encrypted Content Distribution Using Private Broadcast Encryption (2006) (147)
- Short and Stateless Signatures from the RSA Assumption (2009) (145)
- Defeating Vanish with Low-Cost Sybil Attacks Against Large DHTs (2010) (143)
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory (2015) (125)
- Replacing a Random Oracle: Full Domain Hash From Indistinguishability Obfuscation (2014) (113)
- Bi-Deniable Public-Key Encryption (2011) (108)
- Time-Lock Puzzles from Randomized Encodings (2016) (105)
- Low Overhead Broadcast Encryption from Multilinear Maps (2014) (105)
- Fully Secure HIBE with Short Ciphertexts (2009) (101)
- Realizing Hash-and-Sign Signatures under Standard Assumptions (2009) (100)
- Functional encryption: a new vision for public-key cryptography (2012) (97)
- Identity-Based Encryption Secure against Selective Opening Attack (2011) (96)
- Full Domain Hash from (Leveled) Multilinear Maps and Identity-Based Aggregate Signatures (2013) (92)
- Forward-secure signatures with untrusted update (2006) (91)
- Black-box accountable authority identity-based encryption (2008) (91)
- Lockable Obfuscation (2017) (89)
- New constructions and practical applications for private stream searching (2006) (88)
- Witness Encryption from Instance Independent Assumptions (2014) (87)
- Building efficient fully collusion-resilient traitor tracing and revocation schemes (2010) (85)
- New Techniques for Private Stream Searching (2009) (79)
- Storing Secrets on Continually Leaky Devices (2011) (76)
- How to leak on key updates (2011) (75)
- Efficient pseudorandom functions from the decisional linear assumption and weaker variants (2009) (66)
- Standard Security Does Not Imply Security against Selective-Opening (2012) (66)
- Targeted malleability: homomorphic encryption for restricted computations (2012) (64)
- Constructing Verifiable Random Functions with Large Input Spaces (2010) (63)
- Pairing-Based Cryptography - Pairing 2009, Third International Conference, Palo Alto, CA, USA, August 12-14, 2009, Proceedings (2009) (62)
- Cloaking Malware with the Trusted Platform Module (2011) (61)
- On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations (2008) (60)
- A Generic Approach to Constructing and Proving Verifiable Random Functions (2017) (58)
- Identity-Based (Lossy) Trapdoor Functions and Applications (2012) (57)
- Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model (2015) (51)
- Receiver anonymity via incomparable public keys (2003) (46)
- Dual Form Signatures: An Approach for Proving Security from Static Assumptions (2012) (46)
- How to Generate and Use Universal Samplers (2016) (44)
- Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys (2013) (44)
- Adaptive Security in Broadcast Encryption Systems (2008) (44)
- New Constructions and Proof Methods for Large Universe Attribute-Based Encryption (2012) (43)
- Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security (2012) (41)
- Why Proving HIBE Systems Secure Is Difficult (2014) (40)
- Collusion resistant traitor tracing from learning with errors (2018) (39)
- Universal Signature Aggregators (2015) (38)
- Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption (2019) (38)
- Semi-adaptive Security and Bundling Functionalities Made Generic and Easy (2016) (36)
- Adaptively Secure Constrained Pseudorandom Functions (2019) (36)
- Privacy management for portable recording devices (2004) (33)
- Separations in Circular Security for Arbitrary Length Key Cycles (2015) (32)
- Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles (2013) (32)
- New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators (2015) (32)
- New Negative Results on Differing-Inputs Obfuscation (2016) (31)
- Anon-Pass: Practical Anonymous Subscriptions (2013) (29)
- Shrinking the Keys of Discrete-Log-Type Lossy Trapdoor Functions (2010) (27)
- Cryptographic Methods for Storing Ballots on a Voting Machine (2007) (26)
- Traitor-Tracing from LWE Made Simple and Attribute-Based (2018) (22)
- Fully Secure and Fast Signing from Obfuscation (2014) (21)
- New Circular Security Counterexamples from Decision Linear and Learning with Errors (2015) (21)
- Constrained Pseudorandom Functions for Unconstrained Inputs (2016) (21)
- Synchronized Aggregate Signatures from the RSA Assumption (2018) (20)
- Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption (2017) (20)
- Harvesting verifiable challenges from oblivious online sources (2007) (19)
- ABE for DFA from k-Lin (2019) (19)
- Analysis-Resistant Malware (2008) (18)
- Watermarking Public-Key Cryptographic Primitives (2019) (18)
- Circular Security Separations for Arbitrary Length Cycles from LWE (2016) (17)
- Attribute-Based Encryption (2009) (16)
- Functional Encryption: Origins and Recent Developments (2013) (16)
- How to Generate and use Universal Parameters (2014) (14)
- Decentralized Multi-Authority ABE for DNFs from LWE (2020) (14)
- New Approaches to Traitor Tracing with Embedded Identities (2019) (14)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (2015) (14)
- Deterministic Public-Key Encryption Under Continual Leakage (2016) (14)
- The k-BDH Assumption Family: Bilinear Map Cryptography from Progressively Weaker Assumptions (2013) (13)
- Anon-Pass: Practical Anonymous Subscriptions (2013) (13)
- On Perfect Correctness in (Lockable) Obfuscation (2019) (13)
- Risky Traitor Tracing and New Differential Privacy Negative Results (2018) (12)
- On the Insecurity of Parallel Repetition for Leakage Resilience (2010) (11)
- Hiding secrets in software (2016) (10)
- Broadcast and Trace with N^ε Ciphertext Size from Standard Assumptions (2019) (10)
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products (2012) (9)
- Impossibility of Simulation Secure Functional Encryption Even with Random Oracles (2018) (9)
- Collusion Resistant Broadcast and Trace from Positional Witness Encryption (2019) (8)
- New Constructions of Hinting PRGs, OWFs with Encryption, and more (2020) (8)
- Batch Arguments for NP and More from Standard Bilinear Group Assumptions (2022) (7)
- Chosen Ciphertext Security from Injective Trapdoor Functions (2020) (7)
- Reconstructing a fragmented face from a cryptographic identification protocol (2013) (7)
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles (2017) (6)
- Circular Security Counterexamples for Arbitrary Length Cycles from LWE (2016) (6)
- Beyond Software Watermarking: Traitor-Tracing for Pseudorandom Functions (2020) (6)
- Fully Collusion Resistant Traitor Tracing (2006) (5)
- Black-Box Non-Interactive Non-Malleable Commitments (2020) (5)
- Fuzzy identities and attribute-based encryption (2007) (4)
- Relaxed Two-to-One Recoding Schemes (2014) (4)
- Rethinking Verifiably Encrypted Signatures: A Gap in Functionality and Potential Solutions (2014) (4)
- Signature Schemes with Randomized Verification (2017) (3)
- Dynamic Collusion Bounded Functional Encryption from Identity-Based Encryption (2021) (3)
- Compact Signatures for Network Coding (2008) (3)
- Targeted Lossy Functions and Applications (2021) (3)
- New Techniques in Replica Encodings with Client Setup (2020) (3)
- Upgrading to Functional Encryption (2018) (2)
- Output Compression, MPC, and iO for Turing Machines (2019) (2)
- New Methods and Abstractions for RSA-Based Forward Secure Signatures (2020) (2)
- Bounded Collusion ABE for TMs from IBE (2021) (2)
- Decentralized Multi-Authority ABE for NC^1 from Computational-BDH (2021) (1)
- Fully Adaptive Decentralized Multi-Authority ABE (2022) (1)
- Signing a subspace: Signatures for network coding (2009) (1)
- Compact Proofs of Retrievability (2012) (1)
- Computing on Authenticated Data (2014) (1)
- On the CCA Compatibility of Public-Key Infrastructure (2021) (1)
- PPE Circuits: Formal Definition to Software Automation (2020) (1)
- Adaptive Security via Deletion in Attribute-Based Encryption: Solutions from Search Assumptions in Bilinear Groups (2021) (1)
- Fully Succinct Batch Arguments for sfNP from Indistinguishability Obfuscation (2022) (0)
- How to Sample a Discrete Gaussian (and more) from a Random Oracle (2022) (0)
- Efficient Identity-Based Encryption Without Random Oracles Preliminary Version (2004) (0)
- Decentralized Multi-authority ABE for sfNC1 from BDH (2023) (0)
- Adaptive Multiparty NIKE (2022) (0)
- Universal Samplers with Fast Verification (2017) (0)
- On Non-uniform Security for Black-box Non-Interactive CCA Commitments (2022) (0)
- Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles (2012) (0)
- Non-Interactive Publicly-Verifiable Delegation of Committed Programs (2022) (0)
- Multi-Authority ABE from Lattices without Random Oracles (2022) (0)
- Encoding Functions with Constant Online Rate or How to Compress Keys in Garbled Circuits (2012) (0)
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface (2009) (0)
- Broadcast and Trace with N^epsilon Ciphertext Size from Standard Assumptions (2019) (0)
- Unvanish : The Remarkable Peristence of Bits (2009) (0)
- Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography (2009) (0)
- Optimizing Memory Side-Channel Defenses through Amortized Execution (2018) (0)
- Fuzzy Identity Based Encryption Preliminary Version (2004) (0)
- Registered Attribute-Based Encryption (2022) (0)
This paper list is powered by the following services: