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)
- Speeding-up verification of digital signatures
- A gapless code-based hash proof system based on RQC and its applications
- Interactive proofs for social graphs
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- New technique for chosen-ciphertext security based on non-interactive zero-knowledge
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- On the (In)security of Kilian-based SNARGs
- Access with pseudonyms
- ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
- Adaptive proofs have straightline extractors (in the random oracle model)
- Blind polynomial evaluation and data trading
- Unlinkable and invisible \(\gamma \)-sanitizable signatures
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- LESS-FM: fine-tuning signatures from the code equivalence problem
- On removing rejection conditions in practical lattice-based signatures
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
- Subquadratic SNARGs in the random oracle model
- Time- and space-efficient arguments from groups of unknown order
- Logarithmic-size ring signatures with tight security from the DDH assumption
- Parallelizable delegation from LWE
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
- Promise $$\varSigma $$-Protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on Class Groups
- A compressed \(\varSigma \)-protocol theory for lattices
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
- Tight state-restoration soundness in the algebraic group model
- Prêt à voter with Paillier encryption
- The security of the code-based signature scheme based on the Stern identification protocol
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
- Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
- Title not available (Why is that?)
- Succinct non-interactive arguments via linear interactive proofs
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- Composition with knowledge assumptions
- Does Fiat-Shamir require a cryptographic hash function?
- Non-interactive batch arguments for NP from standard assumptions
- An efficient self-blindable attribute-based credential scheme
- How to challenge and cast your e-vote
- Actively secure half-gates with minimum overhead under duplex networks
- An incremental PoSW for general weight distributions
- Privacy-preserving blueprints
- Spartan and bulletproofs are simulation-extractable (for free!)
- Supersingular curves you can trust
- Ligero: lightweight sublinear arguments without a trusted setup
- Cryptographic reverse firewalls for interactive proof systems
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Improved straight-line extraction in the random oracle model with applications to signature aggregation
- SNACKs: leveraging proofs of sequential work for blockchain light clients
- Nova: recursive zero-knowledge arguments from folding schemes
- Orion: zero knowledge proof with linear prover time
- Implementing secure reporting of sexual misconduct -- revisiting WhoToo
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)
- An isogeny-based ID protocol using structured public keys
- Cross-domain attribute-based access control encryption
- Issuer-hiding attribute-based credentials
- Report and trace ring signatures
- Functional commitments for all functions, with transparent setup and from SIS
- Sok: vector OLE-based zero-knowledge protocols
- Registered attribute-based encryption
- On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes
- Improved zero-knowledge argument of encrypted extended permutation
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Dynamic universal accumulator with batch update over bilinear groups
- Layering quantum-resistance into classical digital signature algorithms
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Efficient isogeny proofs using generic techniques
- Spooky interaction and its discontents: compilers for succinct two-message argument systems
- Cryptographic voting -- a gentle introduction
- A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
- Lattice-based e-cash, revisited
- Fast secure two-party ECDSA signing
- Multi-theorem preprocessing NIZKs from lattices
- PPAD is as hard as LWE and iterated squaring
- Adaptive oblivious transfer with access control from lattice assumptions
- Reusing nonces in Schnorr signatures (and keeping it secure...)
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- Gemini: elastic SNARKs for diverse environments
- On succinct non-interactive arguments in relativized worlds
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
- On the multi-user security of short Schnorr signatures with preprocessing
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- General linear group action on tensors: a candidate for post-quantum cryptography
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Sampling from arbitrary centered discrete Gaussians for lattice-based cryptography
- Lossy identification schemes from decisional RSA
- Deterring Certificate Subversion: Efficient Double-Authentication-Preventing Signatures
- Elimination-based certificates for triangular equivalence and rank profiles
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- On publicly-accountable zero-knowledge and small shuffle arguments
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- Efficient RSA key generation and threshold Paillier in the two-party setting
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)
