How To Prove Yourself: Practical Solutions to Identification and Signature Problems
From MaRDI portal
Publication:3777940
DOI10.1007/3-540-47721-7_12zbMATH Open0636.94012DBLPconf/crypto/FiatS86OpenAlexW1589034595WikidataQ21721403 ScholiaQ21721403MaRDI QIDQ3777940FDOQ3777940
Authors: Adi Shamir, Amos Fiat 
Publication date: 1987
Published in: Advances in Cryptology — CRYPTO’ 86 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-47721-7_12
Recommendations
Cited In (only showing first 100 items - show all)
- Balancing privacy and accountability in blockchain identity management
- Lattice-based proof of shuffle and applications to electronic voting
- More efficient shuffle argument from unique factorization
- Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures
- SoK: how (not) to design and implement post-quantum cryptography
- Rogue-key attacks on the multi-designated verifiers signature scheme
- On the Portability of Generalized Schnorr Proofs
- Unifying Zero-Knowledge Proofs of Knowledge
- Improved identification schemes based on error-correcting codes
- A random oracle for all of us
- A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies
- Code-Based Signature Schemes from Identification Protocols in the Rank Metric
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Fiat-Shamir transformation of multi-round interactive proofs
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- New algorithms for the Deuring correspondence. Towards practical and secure SQISign signatures
- One-shot verifiable encryption from lattices
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- LegRoast: efficient post-quantum signatures from the Legendre PRF
- The return of the SDitH
- Efficient non-malleable commitment schemes
- A zero-knowledge identification scheme based on the \(q\)-ary syndrome decoding problem
- Security of hedged Fiat-Shamir signatures under fault attacks
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Banquet: short and fast signatures from AES
- Cryptanalysis and improvement of an ID-based ad-hoc anonymous identification scheme at CT-RSA 05
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
- PKP-based signature scheme
- Cryptographic assumptions: a position paper
- Verifiable multi-party computation with perfectly private audit trail
- On the hardness of the computational ring-LWR problem and its applications
- Fiat-Shamir for highly sound protocols is instantiable
- A Generic Framework for Accountable Optimistic Fair Exchange Protocol
- Fiat-Shamir for highly sound protocols is instantiable
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Lattice-based SNARGs and their application to more efficient obfuscation
- Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512
- Efficient proof composition for verifiable computation
- A provably secure short signature scheme based on discrete logarithms
- Batch RSA
- On the correlation intractability of obfuscated pseudorandom functions
- On tight security proofs for Schnorr signatures
- Round-optimal black-box protocol compilers
- Optimal resilient threshold GQ signatures
- Partially structure-preserving signatures: lower bounds, constructions and more
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- Indifferentiability of 8-Round Feistel Networks
- Continuous verifiable delay functions
- An efficient identity-based key exchange protocol with KGS forward secrecy for low-power devices
- Zero-knowledge proofs of knowledge for group homomorphisms
- New forward-secure signature schemes with untrusted update
- Pseudorandom functions: three decades later
- Title not available (Why is that?)
- Filling the gap between voters and cryptography in e-voting
- A generic framework for accountable optimistic fair exchange protocol
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Simple and efficient batch verification techniques for verifiable delay functions
- Machine-checked security proofs of cryptographic signature schemes
- On tightly-secure (linkable) ring signatures
- Efficiency limitations for \(\Sigma \)-protocols for group homomorphisms
- Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices
- Non-interactive zero-knowledge proofs to multiple verifiers
- A code-based hybrid signcryption scheme
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications
- An almost-constant round interactive zero-knowledge proof
- New Constructions and Applications of Trapdoor DDH Groups
- On the impossibility of structure-preserving deterministic primitives
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- CSIDH: an efficient post-quantum commutative group action
- Efficient non-malleable commitment schemes
- Cryptanalysis of the binary permuted kernel problem
- Non-interactive zero-knowledge proofs with fine-grained security
- Identity-based signature and extended forking algorithm in the multivariate quadratic setting
- Identification protocols and signature schemes based on supersingular isogeny problems
- Scalable multi-party private set-intersection
- A new NP-complete problem and public-key identification
- Verification protocols with sub-linear communication for polynomial matrix operations
- Efficient NIZKs and signatures from commit-and-open protocols in the QROM
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Escrow free attribute-based signature with self-revealability
- Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications
- A lattice-based group signature scheme with verifier-local revocation
- Secret, verifiable auctions from elections
- From Identification to Signatures, Tightly: A Framework and Generic Transforms
- Verifiable elections that scale for free
- Implicit zero-knowledge arguments and applications to the malicious setting
- Efficient public-key cryptography with bounded leakage and tamper resilience
- New realizations of efficient and secure private set intersection protocols preserving fairness
- New number-theoretic cryptographic primitives
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
- Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
- Compact E-Cash and Simulatable VRFs Revisited
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
- Triply adaptive UC NIZK
- Formalising \(\varSigma\)-protocols and commitment schemes using crypthol
- Threshold ring signatures: new definitions and post-quantum security
This page was built for publication: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777940)
