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)
- 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
- Post-quantum ID-based ring signatures from symmetric-key primitives
- Interactive oracle proofs
- Tightly secure ring signatures in the standard model
- Traceable ring signatures: general framework and post-quantum security
- Computational integrity with a public random string from quasi-linear PCPs
- Group signatures with user-controlled and sequential linkability
- Optimally sound sigma protocols under DCRA
- A smart contract for boardroom voting with maximum voter privacy
- Efficient round-optimal blind signatures in the standard model
- Fast Reed-Solomon interactive oracle proofs of proximity
- Storing and retrieving secrets on a blockchain
- SCRAPE: scalable randomness attested by public entities
- Tighter Reductions for Forward-Secure Signature Schemes
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Candidate iO from homomorphic encryption schemes
- Efficient redactable signature and application to anonymous credentials
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- Linearly-homomorphic signatures and scalable mix-nets
- SPARKs: succinct parallelizable arguments of knowledge
- Signatures from sequential-OR proofs
- Transparent SNARKs from DARK compilers
- Statistical Zaps and new oblivious transfer protocols
- Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes
- Threshold schemes from isogeny assumptions
- Classical vs quantum random oracles
- Non-interactive zero knowledge from sub-exponential DDH
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work
- Order-C secure multiparty computation for highly repetitive circuits
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- An improvement of multi-exponentiation with encrypted bases argument: smaller and faster
- Fully secure ABE with outsourced decryption against chosen ciphertext attack
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Compact ring signatures from learning with errors
- Secure reliable multicast protocols in a WAN
- Succinct arguments in the quantum random oracle model
- Scalable zero knowledge via cycles of elliptic curves
- Efficient fully secure computation via distributed zero-knowledge proofs
- Secure MPC: laziness leads to GOD
- Inner-product functional encryption from random linear codes: trial and challenges
- The hunting of the SNARK
- Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures
- On the Security of Online/Offline Signatures and Multisignatures from ACISP’06
- Two-round man-in-the-middle security from LPN
- LESS is more: code-based signatures without syndromes
- On the tightness of forward-secure signature reductions
- Malleable commitments from group actions and zero-knowledge proofs for circuits based on isogenies
- CSI-Otter: isogeny-based (partially) blind signatures from the class group action with a twist
- eSTARK: extending STARKs with arguments
- Privacy enhanced secure compact attribute-based signature from MQ problem for monotone span program
- \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head
- Fully dynamic attribute-based signatures for circuits from codes
- Probabilistic hash-and-sign with retry in the quantum random oracle model
- Tropical cryptography. III: Digital signatures
- Simulation-extractable KZG polynomial commitments and applications to HyperPlonk
- Succinct verification of compressed sigma protocols in the updatable SRS setting
- Zero knowledge protocols and signatures from the restricted syndrome decoding problem
- Efficient KZG-based univariate sum-check and lookup argument
- New proof systems and an OPRF from CSIDH
- On structure-preserving cryptography and lattices
- More efficient public-key cryptography with leakage and tamper resilience
- Attribute-based signatures with advanced delegation, and tracing
- Cutting the GRASS: threshold group action signature schemes
- Short code-based one-out-of-many proofs and applications
- Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
- \textsf{Jolt}: SNARKs for virtual machines via lookups
- Constant-size zk-SNARKs in ROM from falsifiable assumptions
- Monotone-policy aggregate signatures
- M\&M's: mix and match attacks on Schnorr-type blind signatures with repetition
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
- Toward malicious constant-rate 2PC via arithmetic garbling
- Unlocking the lookup singularity with \textsf{Lasso}
- Signatures with memory-tight security in the quantum random oracle model
- Aggregating Falcon signatures with LaBRADOR
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)
