Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
type: Item
instance of: scholarly article
title: Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
zbMATH Open document ID: 1469.94107
author: Benoît Libert
author: Damien Stehlé
author: Radu Titiu
published in: Journal of Cryptology
publication date: 2021-07-30T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 7376835
zbMATH Keywords: \(\mathsf{LWE}\)
zbMATH Keywords: pseudorandom functions
zbMATH Keywords: distributed PRFs
zbMATH Keywords: threshold cryptography
zbMATH Keywords: adaptive security
MaRDI profile type: Publication
full work available at URL: s00145-021-09393-0
OpenAlex ID: W3171038780
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Efficient Lattice (H)IBE in the Standard Model
cites work: Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices
cites work: Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
cites work: Simplified Threshold RSA with Adaptive and Proactive Security
cites work: Learning with Rounding, Revisited
cites work: New and Improved Key-Homomorphic Pseudorandom Functions
cites work: Pseudorandom Functions and Lattices
cites work: Identity-Based (Lossy) Trapdoor Functions and Applications
cites work: Q3202940
cites work: Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
cites work: How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE
cites work: Threshold cryptosystems from threshold fully homomorphic encryption
cites work: Key Homomorphic PRFs and Their Applications
cites work: Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
cites work: Q4941850
cites work: An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
cites work: Déjà Q: Using Dual Systems to Revisit q-Type Assumptions
cites work: Decentralized multi-client functional encryption for inner product
cites work: Q4250770
cites work: Q4409124
cites work: Public Key Cryptography - PKC 2006
cites work: Efficient Construction of (Distributed) Verifiable Random Functions
cites work: Public Key Cryptography - PKC 2005
cites work: Theory of Cryptography
cites work: Q4938769
cites work: Programmable Hash Functions in the Multilinear Setting
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
cites work: Q3729902
cites work: Multi-input Functional Encryption
cites work: Leveled Fully Homomorphic Signatures from Standard Lattices
cites work: A generic approach to constructing and proving verifiable random functions
cites work: A Pseudorandom Generator from any One-way Function
cites work: Programmable Hash Functions and Their Applications
cites work: Monotone Circuits for the Majority Function
cites work: Verifiable Random Functions from Weaker Assumptions
cites work: Q3374910
cites work: Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
cites work: Born and raised distributively
cites work: Multi-client functional encryption for linear functions in the standard model from LWE
cites work: Q4474183
cites work: Q4343434
cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: Q4250771
cites work: Number-theoretic constructions of efficient pseudo-random functions
cites work: Pseudo-random functions and factoring (extended abstract)
cites work: Q4409132
cites work: Lossy trapdoor functions and their applications
cites work: Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions
cites work: Natural proofs
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Short monotone formulae for the majority function
cites work: A theory of the learnable
cites work: Efficient Identity-Based Encryption Without Random Oracles
cites work: Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
DOI: 10.1007/S00145-021-09393-0