Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
From MaRDI portal
Publication:2061957
DOI10.1007/978-3-030-75248-4_10zbMath1479.94107OpenAlexW3165229199MaRDI QIDQ2061957
Martin R. Albrecht, Alex Davidson, Amit Deo, Nigel P. Smart
Publication date: 21 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75248-4_10
Related Items (5)
Round-optimal oblivious transfer and MPC from computational CSIDH ⋮ Quantum-resistant password-based threshold single-sign-on authentication with updatable server private key ⋮ How to obfuscate MPC inputs ⋮ Cryptanalysis of an oblivious PRF from supersingular isogenies ⋮ Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
Cites Work
- Unnamed Item
- On the concrete hardness of learning with errors
- New bounds in some transference theorems in the geometry of numbers
- OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
- Private constrained PRFs (and more) from LWE
- Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
- Privately constraining and programming PRFs, the LWE way
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Revisiting post-quantum Fiat-Shamir
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Oblivious pseudorandom functions from isogenies
- A Decade of Lattice Cryptography
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Key Homomorphic PRFs and Their Applications
- New and Improved Key-Homomorphic Pseudorandom Functions
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Pseudorandom Functions and Lattices
- Lattice Signatures without Trapdoors
- Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
- Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
- Random Oracles in a Quantum World
- Public-Key Encryption Schemes with Auxiliary Inputs
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The knowledge complexity of interactive proof-systems
- Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
- Classical hardness of learning with errors
- Theory of Cryptography
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
