Pseudorandom Functions and Lattices

DOI10.1007/978-3-642-29011-4_42zbMath1297.68071OpenAlexW190530026MaRDI QIDQ2894440

Abhishek Banerjee, Alon Rosen, Chris Peikert

Publication date: 29 June 2012

Published in: Advances in Cryptology – EUROCRYPT 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29011-4_42

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (90)

Limits on the Efficiency of (Ring) LWE Based Non-interactive Key Exchange ⋮ Constraining and Watermarking PRFs from Milder Assumptions ⋮ Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More ⋮ Shortest vectors in lattices of Bai-Galbraith's embedding attack on the LWR problem ⋮ Key mismatch attack on ThreeBears, Frodo and Round5 ⋮ Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security ⋮ Adaptively secure distributed PRFs from LWE ⋮ Exploring crypto dark matter: new simple PRF candidates and their applications ⋮ Quantum algorithms for the \(k\)-XOR problem ⋮ Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2\)] ⋮ Fast Pseudorandom Functions Based on Expander Graphs ⋮ Approximate-Deterministic Public Key Encryption from Hard Learning Problems ⋮ From Selective to Adaptive Security in Functional Encryption ⋮ Efficient Pseudorandom Functions via On-the-Fly Adaptation ⋮ An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security ⋮ Practical post-quantum few-time verifiable random function with applications to Algorand ⋮ Watermarking Cryptographic Capabilities ⋮ The polynomial learning with errors problem and the smearing condition ⋮ Multitarget Decryption Failure Attacks and Their Application to Saber and Kyber ⋮ Two-Round Oblivious Linear Evaluation from Learning with Errors ⋮ Matrix PRFs: constructions, attacks, and applications to obfuscation ⋮ From FE combiners to secure MPC and back ⋮ Semi-quantum money ⋮ Efficient and fully secure lattice-based IBE with equality test ⋮ Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs ⋮ On homomorphic secret sharing from polynomial-modulus LWE ⋮ Towards Tightly Secure Lattice Short Signature and Id-Based Encryption ⋮ FORSAKES: a forward-secure authenticated key exchange protocol based on symmetric key-evolving schemes ⋮ \texttt{POLKA}: towards leakage-resistant post-quantum CCA-secure public key encryption ⋮ Solving LWR via BDD Strategy: Modulus Switching Approach ⋮ Efficient unique ring signatures from lattices ⋮ A note on the post-quantum security of (ring) signatures ⋮ Multi-authority ABE from lattices without random oracles ⋮ Computational fuzzy extractor from LWE ⋮ Cumulatively all-lossy-but-one trapdoor functions from standard assumptions ⋮ Witness encryption and null-iO from evasive LWE ⋮ Formal verification of Saber's public-key encryption scheme in easycrypt ⋮ Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding ⋮ Unnamed Item ⋮ Batched fully dynamic multi-key FHE from FHEW-like cryptosystems ⋮ Learning with physical rounding for linear and quadratic leakage functions ⋮ Constant input attribute based (and predicate) encryption from evasive and tensor LWE ⋮ Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs ⋮ Error correction and ciphertext quantization in lattice cryptography ⋮ A lower bound for proving hardness of learning with rounding with polynomial modulus ⋮ Hardness of (M)LWE with semi-uniform seeds ⋮ Improving speed and security in updatable encryption schemes ⋮ Scalable ciphertext compression techniques for post-quantum KEMs and their applications ⋮ Lattice-based e-cash, revisited ⋮ A combinatorial approach to quantum random functions ⋮ Direct computation of branching programs and its applications to more efficient lattice-based cryptography ⋮ Simulatable verifiable random function from the LWE assumption ⋮ Simple and more efficient PRFs with tight security from LWE and matrix-DDH ⋮ Compact Hierarchical IBE from Lattices in the Standard Model ⋮ 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 ⋮ Strongly secure authenticated key exchange from factoring, codes, and lattices ⋮ NTRU prime: reducing attack surface at low cost ⋮ Pseudorandom functions in NC class from the standard LWE assumption ⋮ Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE ⋮ Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices ⋮ Unnamed Item ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Simple and generic constructions of succinct functional encryption ⋮ On the Hardness of Learning with Rounding over Small Modulus ⋮ Traceable ring signatures: general framework and post-quantum security ⋮ Tighter security proofs for GPV-IBE in the quantum random oracle model ⋮ Adaptively secure distributed PRFs from \(\mathsf{LWE}\) ⋮ Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity ⋮ Limits on the efficiency of (ring) LWE-based non-interactive key exchange ⋮ Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ On the integer polynomial learning with errors problem ⋮ Rate-1 key-dependent message security via reusable homomorphic extractor against correlated-source attacks ⋮ Round-optimal verifiable oblivious pseudorandom functions from ideal lattices ⋮ Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems ⋮ Interactive Clustering of Linear Classes and Cryptographic Lower Bounds ⋮ Unnamed Item ⋮ Quantum Hardness of Learning Shallow Classical Circuits ⋮ Adaptively secure constrained pseudorandom functions in the standard model ⋮ Rounding in the rings ⋮ Multi-use Deterministic Public Key Proxy Re-Encryption from Lattices in the Auxiliary-Input Setting ⋮ A new post-quantum multivariate polynomial public key encapsulation algorithm ⋮ Pseudorandom Functions: Three Decades Later ⋮ Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption ⋮ Short identity-based signatures with tight security from lattices ⋮ Hardness of LWE on general entropic distributions ⋮ Key-homomorphic pseudorandom functions from LWE with small modulus

This page was built for publication: Pseudorandom Functions and Lattices