Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE

DOI10.1007/978-3-319-56620-7_16zbMath1410.94055OpenAlexW2603265044MaRDI QIDQ5738886

Yilei Chen, Ran Canetti

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-319-56620-7_16

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (30)

Constraining and Watermarking PRFs from Milder Assumptions ⋮ Traitor-tracing from LWE made simple and attribute-based ⋮ Return of GGH15: provable security against zeroizing attacks ⋮ 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 ⋮ Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Optimal broadcast encryption and CP-ABE from evasive lattice assumptions ⋮ Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Constrained pseudorandom functions from homomorphic secret sharing ⋮ Programmable distributed point functions ⋮ Adaptive multiparty NIKE ⋮ Witness encryption and null-iO from evasive LWE ⋮ Optimal single-server private information retrieval ⋮ Constrained (Verifiable) Pseudorandom Function from Functional Encryption ⋮ \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH ⋮ Adaptively secure inner product encryption from LWE ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Pseudorandom functions in NC class from the standard LWE assumption ⋮ 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 ⋮ New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts ⋮ Round-optimal verifiable oblivious pseudorandom functions from ideal lattices ⋮ Adaptively secure constrained pseudorandom functions in the standard model ⋮ Collusion resistant watermarkable PRFs from standard assumptions ⋮ Key-homomorphic pseudorandom functions from LWE with small modulus

Uses Software

• ring-LWE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Advances in cryptology -- CRYPTO 2013. 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18--22, 2013. Proceedings, Part I
• Generating shorter bases for hard random lattices
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings
• Worst-case to average-case reductions for module lattices
• Obfuscating Conjunctions under Entropic Ring LWE
• Cryptanalysis of GGH Map
• (Leveled) fully homomorphic encryption without bootstrapping
• Cryptanalysis of GGH15 Multilinear Maps
• Key Homomorphic PRFs and Their Applications
• Practical Multilinear Maps over the Integers
• Functional Encryption: New Perspectives and Lower Bounds
• Constrained Pseudorandom Functions and Their Applications
• New and Improved Key-Homomorphic Pseudorandom Functions
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Pseudorandom Functions and Lattices
• Ring-LWE in Polynomial Rings
• Cryptanalysis of the Multilinear Map over the Integers
• Functional Encryption: Definitions and Challenges
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Trapdoors for hard lattices and new cryptographic constructions
• Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
• Candidate Multilinear Maps from Ideal Lattices
• A Toolkit for Ring-LWE Cryptography
• Public-key cryptosystems from the worst-case shortest vector problem
• Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
• Graph-Induced Multilinear Maps from Lattices
• Cryptanalyses of Candidate Branching Program Obfuscators
• On the (im)possibility of obfuscating programs
• On Ideal Lattices and Learning with Errors over Rings
• Functional Signatures and Pseudorandom Functions
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Reusable garbled circuits and succinct functional encryption
• Classical hardness of learning with errors
• Constraining Pseudorandom Functions Privately
• Short Stickelberger Class Relations and Application to Ideal-SVP
• Private Puncturable PRFs from Standard Lattice Assumptions
• Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
• Recovering Short Generators of Principal Ideals in Cyclotomic Rings
• Theory of Cryptography
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE