Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
type: Item
instance of: scholarly article
title: Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
zbMATH Open document ID: 1479.94107
DOI: 10.1007/978-3-030-75248-4_10
author: Martin R. Albrecht
author: Alex Davidson
author: Amit Deo
author: N. P. Smart
publication date: 2021-12-21T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7450208
zbMATH Keywords: verifiable pseudorandom functions
zbMATH Keywords: zero-knowledge
MaRDI profile type: Publication
full work available at URL: 978-3-030-75248-4 10
OpenAlex ID: W3165229199
cites work: On the concrete hardness of learning with errors
cites work: New bounds in some transference theorems in the geometry of numbers
cites work: New and Improved Key-Homomorphic Pseudorandom Functions
cites work: Pseudorandom Functions and Lattices
cites work: Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
cites work: Random Oracles in a Quantum World
cites work: Oblivious pseudorandom functions from isogenies
cites work: Key Homomorphic PRFs and Their Applications
cites work: Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
cites work: Classical hardness of learning with errors
cites work: Private constrained PRFs (and more) from LWE
cites work: Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
cites work: Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
cites work: Public-Key Encryption Schemes with Auxiliary Inputs
cites work: Security of the Fiat-Shamir transformation in the quantum random-oracle model
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Theory of Cryptography
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: Q3777937
cites work: The knowledge complexity of interactive proof-systems
cites work: Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
cites work: OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
cites work: Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
cites work: Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
cites work: Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
cites work: Revisiting post-quantum Fiat-Shamir
cites work: Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
cites work: Lattice Signatures without Trapdoors
cites work: On Ideal Lattices and Learning with Errors over Rings
cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
cites work: A decade of lattice cryptography
cites work: Privately constraining and programming PRFs, the LWE way
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
description: scientific article; zbMATH DE number 7450208