( en | de | ru )

 

Disambiguation of "Waters, Brent"

Author of the publication

copydeleteadd this publication to your clipboard
Conjunctive, Subset, and Range Queries on Encrypted Data.

, and . TCC, volume 4392 of Lecture Notes in Computer Science, page 535-554. Springer, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Brent Huisman

Werner Waters

Brent Dingle

Brent Sörensen

Brent Longstaff

 

Other publications of authors with the same name

Impossibility of Simulation Secure Functional Encryption Even with Random Oracles., , and . TCC (1), volume 11239 of Lecture Notes in Computer Science, page 659-688. Springer, (2018)Beyond Software Watermarking: Traitor-Tracing for Pseudorandom Functions., , , and . ASIACRYPT (3), volume 13092 of Lecture Notes in Computer Science, page 250-280. Springer, (2021)Efficient pseudorandom functions from the decisional linear assumption and weaker variants., and . ACM Conference on Computer and Communications Security, page 112-120. ACM, (2009)PPE Circuits: Formal Definition to Software Automation., , and . ACM Conference on Computer and Communications Security, page 391-408. ACM, (2020)Separating IND-CPA and Circular Security for Unbounded Length Key Cycles., , and . Public Key Cryptography (1), volume 10174 of Lecture Notes in Computer Science, page 232-246. Springer, (2017)Full-Domain Subgroup Hiding and Constant-Size Group Signatures., and . Public Key Cryptography, volume 4450 of Lecture Notes in Computer Science, page 1-15. Springer, (2007)Collusion Resistant Broadcast and Trace from Positional Witness Encryption., , and . Public Key Cryptography (2), volume 11443 of Lecture Notes in Computer Science, page 3-33. Springer, (2019)Black-Box Non-Interactive Non-Malleable Commitments., , , and . IACR Cryptol. ePrint Arch., (2020)Batch Arguments for NP and More from Standard Bilinear Group Assumptions., and . IACR Cryptol. ePrint Arch., (2022)Output Compression, MPC, and iO for Turing Machines., , , , and . ASIACRYPT (1), volume 11921 of Lecture Notes in Computer Science, page 342-370. Springer, (2019)