Constraining Pseudorandom Functions Privately

DOI10.1007/978-3-662-54388-7_17zbMath1400.94124OpenAlexW2592974355MaRDI QIDQ5738766

Kevin Lewi, David J. Wu, Dan Boneh

Publication date: 13 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-54388-7_17

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (27)

Constraining and Watermarking PRFs from Milder Assumptions ⋮ Traitor-tracing from LWE made simple and attribute-based ⋮ Watermarking PRFs under standard assumptions: public marking and security with extraction queries ⋮ Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time ⋮ Deniable Attribute Based Encryption for Branching Programs from LWE ⋮ Watermarking Cryptographic Capabilities ⋮ Watermarking PRFs against quantum adversaries ⋮ Traceable PRFs: Full Collusion Resistance and Active Security ⋮ Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Constrained pseudorandom functions from homomorphic secret sharing ⋮ Programmable distributed point functions ⋮ Puncturable key wrapping and its applications ⋮ Watermarkable public key encryption with efficient extraction under standard assumptions ⋮ Optimal single-server private information retrieval ⋮ Beyond software watermarking: traitor-tracing for pseudorandom functions ⋮ Public-key watermarking schemes for pseudorandom functions ⋮ Constrained (Verifiable) Pseudorandom Function from Functional Encryption ⋮ \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH ⋮ Constraining Pseudorandom Functions Privately ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Constrained pseudorandom functions from functional encryption ⋮ Private information retrieval with sublinear online time ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ Adaptively secure constrained pseudorandom functions in the standard model ⋮ Collusion resistant watermarkable PRFs from standard assumptions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Preventing CLT attacks on obfuscation with linear overhead
• The Weil pairing, and its efficient calculation
• Multilinear Maps from Obfuscation
• Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Cryptanalysis of the New CLT Multilinear Map over the Integers
• Cryptanalysis of GGH Map
• Cryptanalysis of GGH15 Multilinear Maps
• Practical Multilinear Maps over the Integers
• Constrained Pseudorandom Functions and Their Applications
• Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
• Cryptanalysis of the Multilinear Map over the Integers
• Function Secret Sharing
• How to Obfuscate Programs Directly
• Structured Encryption and Controlled Disclosure
• Number-theoretic constructions of efficient pseudo-random functions
• Secure Obfuscation in a Weak Multilinear Map Model
• Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
• New Multilinear Maps Over the Integers
• From Weak to Strong Watermarking
• Order-Preserving Symmetric Encryption
• Reducing elliptic curve logarithms to logarithms in a finite field
• Candidate Multilinear Maps from Ideal Lattices
• Bi-Deniable Public-Key Encryption
• How to use indistinguishability obfuscation
• Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
• Graph-Induced Multilinear Maps from Lattices
• Obfuscating Circuits via Composite-Order Graded Encoding
• Advances in Cryptology - EUROCRYPT 2004
• Watermarking cryptographic capabilities
• On the (im)possibility of obfuscating programs
• Functional Signatures and Pseudorandom Functions
• Protecting Obfuscation against Algebraic Attacks
• Distributed Point Functions and Their Applications
• Private Searching on Streaming Data
• Theory of Cryptography
• Theory of Cryptography
• Automata, Languages and Programming
• Constraining Pseudorandom Functions Privately

This page was built for publication: Constraining Pseudorandom Functions Privately