Does Fiat-Shamir require a cryptographic hash function?
From MaRDI portal
Publication:2139639
DOI10.1007/978-3-030-84259-8_12zbMath1489.94091OpenAlexW3046296052MaRDI QIDQ2139639
Alex Lombardi, Yilei Chen, Fermi Ma, Willy Quach
Publication date: 18 May 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84259-8_12
Related Items (7)
A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme ⋮ Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA ⋮ A generic transform from multi-round interactive proof to NIZK ⋮ Redeeming reset indifferentiability and applications to post-quantum security ⋮ Correlation intractability and SNARGs from sub-exponential DDH ⋮ A detailed analysis of Fiat-Shamir with aborts ⋮ Lattice-based timed cryptography
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- The Discrete Logarithm problem with preprocessing
- Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
- From obfuscation to the security of Fiat-Shamir for proofs
- Complexity of a determinate algorithm for the discrete logarithm
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Aurora: transparent succinct arguments for R1CS
- Designated-verifier pseudorandom generators, and their applications
- Reusable designated-verifier NIZKs for all NP from CDH
- Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
- Trapdoor hash functions and their applications
- Scalable zero knowledge with no trusted setup
- A Decade of Lattice Cryptography
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
- Interactive Oracle Proofs
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai Trees, or How to Delegate a Lattice Basis
- Random Oracles and Auxiliary Input
- Hash function requirements for Schnorr signatures
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
- Computationally Sound Proofs
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Fully homomorphic encryption using ideal lattices
- Fiat-Shamir: from practice to theory
- Computational Integrity with a Public Random String from Quasi-Linear PCPs
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Cryptography and Coding
This page was built for publication: Does Fiat-Shamir require a cryptographic hash function?
