Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions

DOI10.1007/978-3-662-46497-7_1zbMath1379.94032OpenAlexW113457696MaRDI QIDQ5261668

Zvika Brakerski, Vinod Vaikuntanathan

Publication date: 6 July 2015

Published in: Theory of Cryptography (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (38)

Constraining and Watermarking PRFs from Milder Assumptions ⋮ Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security ⋮ Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions ⋮ Watermarking Cryptographic Capabilities ⋮ Quantum algorithms for variants of average-case lattice problems via filtering ⋮ Attribute-based proxy re-encryption from standard lattices ⋮ Transparent batchable time-lock puzzles and applications to Byzantine consensus ⋮ Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Constrained pseudorandom functions from homomorphic secret sharing ⋮ ABE for circuits with constant-size secret keys and adaptive security ⋮ Adaptive multiparty NIKE ⋮ Full quantum equivalence of group action DLog and CDH, and more ⋮ Beyond software watermarking: traitor-tracing for pseudorandom functions ⋮ Constrained (Verifiable) Pseudorandom Function from Functional Encryption ⋮ A lower bound for proving hardness of learning with rounding with polynomial modulus ⋮ Adaptively secure inner product encryption from LWE ⋮ Improving speed and security in updatable encryption schemes ⋮ Incremental symmetric puncturable encryption with support for unbounded number of punctures ⋮ Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption ⋮ 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 ⋮ Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation ⋮ Constraining Pseudorandom Functions Privately ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE ⋮ Cryptography with Updates ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs ⋮ Constrained pseudorandom functions from functional encryption ⋮ Revocable attribute-based proxy re-encryption ⋮ Extracting randomness from extractor-dependent sources ⋮ Round-optimal verifiable oblivious pseudorandom functions from ideal lattices ⋮ On publicly-accountable zero-knowledge and small shuffle arguments ⋮ Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ Adaptively secure constrained pseudorandom functions in the standard model ⋮ Pseudorandom Functions: Three Decades Later ⋮ Key-homomorphic pseudorandom functions from LWE with small modulus

This page was built for publication: Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions