Pseudorandom functions and lattices

DOI10.1007/978-3-642-29011-4_42zbMATH Open1297.68071OpenAlexW190530026MaRDI QIDQ2894440FDOQ2894440

Authors: Abhishek Banerjee, Chris Peikert, Alon Rosen

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

Recommendations

Pseudorandom functions in almost constant depth from low-noise LPN
Key-homomorphic pseudorandom functions from LWE with small modulus
Pseudorandom functions from LWE: RKA security and application
More efficient lattice PRFs from keyed pseudorandom synthesizers
Pseudorandom functions in NC class from the standard LWE assumption

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

Cited In (only showing first 100 items - show all)

Semi-quantum money
Quantum algorithms for the $k$-XOR problem
Adaptively secure distributed PRFs from $\mathsf{LWE}$
Solving LWR via BDD Strategy: Modulus Switching Approach
On homomorphic secret sharing from polynomial-modulus LWE
Matrix PRFs: constructions, attacks, and applications to obfuscation
Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
Key mismatch attack on ThreeBears, Frodo and Round5
Number-theoretic constructions of efficient pseudo-random functions
An algebraic framework for pseudorandom functions and applications to related-key security
Short identity-based signatures with tight security from lattices
Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
On the hardness of learning with rounding over small modulus
Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding
Adaptively secure distributed PRFs from LWE
Exploring crypto dark matter: new simple PRF candidates and their applications
Limits on the efficiency of (ring) LWE-based non-interactive key exchange
Shortest vectors in lattices of Bai-Galbraith's embedding attack on the LWR problem
Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security
Pseudorandom functions in almost constant depth from low-noise LPN
A new post-quantum multivariate polynomial public key encapsulation algorithm
Hardness of LWE on general entropic distributions
Watermarking cryptographic capabilities
Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption
Key-homomorphic pseudorandom functions from LWE with small modulus
From selective to adaptive security in functional encryption
Low-complexity weak pseudorandom functions in $\mathtt{AC}0[\mathtt{MOD}2]$
Fast pseudorandom functions based on expander graphs
Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption
Private puncturable PRFs from standard lattice assumptions
A note on the post-quantum security of (ring) signatures
Efficient pseudorandom functions via on-the-fly adaptation
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Multi-authority ABE from lattices without random oracles
Practical post-quantum few-time verifiable random function with applications to Algorand
NTRU prime: reducing attack surface at low cost
Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity
Pseudorandom functions: three decades later
Traceable ring signatures: general framework and post-quantum security
Lattice-based e-cash, revisited
Scalable ciphertext compression techniques for post-quantum KEMs and their applications
The polynomial learning with errors problem and the smearing condition
Multiparty reusable non-interactive secure computation from LWE
Fast lattice-based encryption: stretching SPRING
A pseudorandom number generator based on worst-case lattice problems
Limits on the efficiency of (ring) LWE based non-interactive key exchange
From FE combiners to secure MPC and back
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 practical GGM-based PRF from (module-)learning-with-rounding
Adaptively secure constrained pseudorandom functions in the standard model
Efficient and fully secure lattice-based IBE with equality test
Solovay functions and their applications in algorithmic randomness
Strongly secure authenticated key exchange from factoring, codes, and lattices
FORSAKES: a forward-secure authenticated key exchange protocol based on symmetric key-evolving schemes
Witness encryption and null-iO from evasive LWE
Pseudo-random functions and factoring (extended abstract)
Improving speed and security in updatable encryption schemes
Approximate-deterministic public key encryption from hard learning problems
Cumulatively all-lossy-but-one trapdoor functions from standard assumptions
Efficient unique ring signatures from lattices
Towards tightly secure lattice short signature and id-based encryption
Simple and more efficient PRFs with tight security from LWE and matrix-DDH
More efficient lattice PRFs from keyed pseudorandom synthesizers
Title not available (Why is that?)
Rounding in the rings
Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
A generic construction of an anonymous reputation system and instantiations from lattices
Limits of preprocessing
Formal verification of Saber's public-key encryption scheme in easycrypt
Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
Revocable cryptography from learning with errors
Watermarking cryptographic functionalities from standard lattice assumptions
LERNA: secure single-server aggregation via key-homomorphic masking
Homomorphic evaluation of lattice-based symmetric encryption schemes
Batched fully dynamic multi-key FHE from FHEW-like cryptosystems
Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs
Multitarget decryption failure attacks and their application to Saber and Kyber
Simple and generic constructions of succinct functional encryption
Interactive clustering of linear classes and cryptographic lower bounds
Multi-use deterministic public key proxy re-encryption from lattices in the auxiliary-input setting
Learning with physical rounding for linear and quadratic leakage functions
Towards tightly secure short linearly homomorphic signatures
Symmetric and dual PRFs from standard assumptions: a generic validation of a prevailing assumption
Cryptanalysis of the generalised Legendre pseudorandom function
Quantum hardness of learning shallow classical circuits
Tighter security proofs for GPV-IBE in the quantum random oracle model
Constant input attribute based (and predicate) encryption from evasive and tensor LWE
A lower bound for proving hardness of learning with rounding with polynomial modulus
Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
Error correction and ciphertext quantization in lattice cryptography
\textsf{SMAUG}: pushing lattice-based key encapsulation mechanisms to the limits
Two-round oblivious linear evaluation from learning with errors
Constraining and watermarking PRFs from milder assumptions
Hardness of (M)LWE with semi-uniform seeds
Towards sound fresh re-keying with hard (physical) learning problems
Tagged chameleon hash from lattices and application to redactable blockchain
A direct PRF construction from Kolmogorov complexity

This page was built for publication: Pseudorandom functions and lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894440)