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)
- A Schnorr-Like Lightweight Identity-Based Signature Scheme
- Identity based identification from algebraic coding theory
- Identification scheme and forward-secure signature in identity-based setting from isogenies
- Random oracles and non-uniformity
- Privacy and verifiability in voting systems: methods, developments and trends
- Paillier-based publicly verifiable (non-interactive) secret sharing
- Combined schemes for signature and encryption: the public-key and the identity-based setting
- Salvaging Merkle-Damgård for Practical Applications
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- A Suite of Non-pairing ID-Based Threshold Ring Signature Schemes with Different Levels of Anonymity (Extended Abstract)
- Security proofs for identity-based identification and signature schemes
- Bit commitment using pseudorandomness
- Optimal security proofs for signatures from identification schemes
- Extending concurrent signature to multiple parties
- Generic security-amplifying methods of ordinary digital signatures
- A fair and efficient solution to the socialist millionaires' problem
- Title not available (Why is that?)
- Multi-designated verifiers signatures: anonymity without encryption
- Limits on the usefulness of random oracles
- Efficient signature generation by smart cards
- Hash Functions from Sigma Protocols and Improvements to VSH
- Leakproof secret sharing protocols with applications to group identification scheme
- An Efficient On-Line/Off-Line Signature Scheme without Random Oracles
- Secure Obfuscation of Encrypted Verifiable Encrypted Signatures
- Twin-Beth: security under active and concurrent attacks for the Beth identity-based identification scheme
- Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model
- Blind attribute-based encryption and oblivious transfer with fine-grained access control
- Efficient Non-interactive Range Proof
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- Identity-based cryptosystems and signature schemes
- Verifiable Decryption for Fully Homomorphic Encryption
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Forward-secure multisignature and blind signature schemes
- On server trust in private proxy auctions
- Secure electronic bills of lading: Blind counts and digital signatures
- Two Notes on the Security of Certificateless Signatures
- Tightly secure signatures from lossy identification schemes
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Identity-based partially blind signature in the standard model for electronic cash
- Efficient Traceable Signatures in the Standard Model
- On best-possible obfuscation
- On the amortized complexity of zero-knowledge protocols
- Zero-knowledge proofs of identity
- Title not available (Why is that?)
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Efficient generic on-line/off-line (threshold) signatures without key exposure
- On the connection between leakage tolerance and adaptive security
- Zero-knowledge argument for simultaneous discrete logarithms
- One-time signatures and chameleon hash functions
- Secure identification and QKD in the bounded-quantum-storage model
- Efficient traceable signatures in the standard model
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Adaptively secure threshold symmetric-key encryption
- Group signatures with decentralized tracing
- Lower bounds for non-black-box zero knowledge
- Ring signatures: Stronger definitions, and constructions without random oracles
- Strongly unforgeable ring signature scheme from lattices in the standard model
- Zero-knowledge identification scheme based on Weil pairing
- Improving the exact security of digital signature schemes
- Public Verifiability from Pairings in Secret Sharing Schemes
- \(k\)-critical graphs in \(P_5\)-free graphs
- Fully leakage-resilient signatures
- \(k\)-anonymous data collection
- Identity-based authenticated encryption with identity confidentiality
- How to obtain full privacy in auctions
- On the computational hardness of the code equivalence problem in cryptography
- Hash function requirements for Schnorr signatures
- A code-based group signature scheme
- Forward-secure ID based digital signature scheme with forward-secure private key generator
- A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
- Tight security for the generic construction of identity-based signature (in the multi-instance setting)
- Bounded tamper resilience: how to go beyond the algebraic barrier
- A correction to a code-based blind signature scheme
- Several practical protocols for authentication and key exchange
- 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
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)
