How To Prove Yourself: Practical Solutions to Identification and Signature Problems
From MaRDI portal
Publication:3777940
Recommendations
Cited in
(only showing first 100 items - show all)- On the hardness of the computational ring-LWR problem and its applications
- Verifiable multi-party computation with perfectly private audit trail
- Fiat-Shamir for highly sound protocols is instantiable
- Fiat-Shamir for highly sound protocols is instantiable
- A Generic Framework for Accountable Optimistic Fair Exchange Protocol
- A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies
- Efficient non-malleable commitment schemes
- Continuous verifiable delay functions
- New Constructions and Applications of Trapdoor DDH Groups
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Lattice-based SNARGs and their application to more efficient obfuscation
- On the Portability of Generalized Schnorr Proofs
- An efficient identity-based key exchange protocol with KGS forward secrecy for low-power devices
- Zero-knowledge proofs of knowledge for group homomorphisms
- On the impossibility of structure-preserving deterministic primitives
- CSIDH: an efficient post-quantum commutative group action
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds
- Unifying Zero-Knowledge Proofs of Knowledge
- Simple and efficient batch verification techniques for verifiable delay functions
- One-shot verifiable encryption from lattices
- Fiat-Shamir transformation of multi-round interactive proofs
- A zero-knowledge identification scheme based on the \(q\)-ary syndrome decoding problem
- scientific article; zbMATH DE number 4123668 (Why is no real title available?)
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- An almost-constant round interactive zero-knowledge proof
- 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
- Filling the gap between voters and cryptography in e-voting
- Optimal resilient threshold GQ signatures
- Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512
- New forward-secure signature schemes with untrusted update
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
- Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Batch RSA
- Machine-checked security proofs of cryptographic signature schemes
- Indifferentiability of 8-Round Feistel Networks
- Round-optimal black-box protocol compilers
- On tightly-secure (linkable) ring signatures
- Non-interactive zero-knowledge proofs to multiple verifiers
- Cryptanalysis of the binary permuted kernel 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
- PKP-based signature scheme
- On the correlation intractability of obfuscated pseudorandom functions
- Code-Based Signature Schemes from Identification Protocols in the Rank Metric
- Non-interactive zero-knowledge proofs with fine-grained security
- Efficiency limitations for \(\Sigma \)-protocols for group homomorphisms
- New algorithms for the Deuring correspondence. Towards practical and secure SQISign signatures
- Pseudorandom functions: three decades later
- Efficient proof composition for verifiable computation
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- A generic framework for accountable optimistic fair exchange protocol
- Partially structure-preserving signatures: lower bounds, constructions and more
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices
- On tight security proofs for Schnorr signatures
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Improved identification schemes based on error-correcting codes
- A code-based hybrid signcryption scheme
- A random oracle for all of us
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- LegRoast: efficient post-quantum signatures from the Legendre PRF
- Rogue-key attacks on the multi-designated verifiers signature scheme
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- A provably secure short signature scheme based on discrete logarithms
- Cryptanalysis and improvement of an ID-based ad-hoc anonymous identification scheme at CT-RSA 05
- The return of the SDitH
- Cryptographic assumptions: a position paper
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Efficient non-malleable commitment schemes
- On rejection sampling in Lyubashevsky's signature scheme
- Identity-based interactive aggregate signatures from lattices
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- A New Dynamic Code-Based Group Signature Scheme
- Inner product functional commitments with constant-size public parameters and openings
- New technique for chosen-ciphertext security based on non-interactive zero-knowledge
- 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
- Adaptive proofs have straightline extractors (in the random oracle model)
- On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
- Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext
- Reusing nonces in Schnorr signatures (and keeping it secure...)
- Elimination-based certificates for triangular equivalence and rank profiles
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme
- Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
- Certifying giant nonprimes
- 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
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)
