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)- A practical group signature scheme based on rank metric
- Non-interactive zero-knowledge proofs with fine-grained security
- Efficient non-malleable commitment schemes
- Identity based identification from algebraic coding theory
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- 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
- Actively secure garbled circuits with constant communication overhead in the plain model
- Unlinkable Randomizable Signature and Its Application in Group Signature
- Speeding-up verification of digital signatures
- A new protocol for multi-item electronic auctions
- A Schnorr-Like Lightweight Identity-Based Signature Scheme
- Towards restricting plaintext space in public key encryption
- Hardness estimates of the code equivalence problem in the rank metric
- On the (in)security of optimized Stern-like signature schemes
- DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF
- Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
- BLOOM: bimodal lattice one-out-of-many proofs and applications
- Classically verifiable NIZK for QMA with preprocessing
- On rejection sampling in Lyubashevsky's signature scheme
- Identity-based interactive aggregate signatures from lattices
- A gapless code-based hash proof system based on RQC and its applications
- Identity-based signature and extended forking algorithm in the multivariate quadratic setting
- Efficient transparent polynomial commitments for zk-SNARKs
- Random oracles and non-uniformity
- stoRNA: stateless transparent proofs of storage-time
- Privacy and verifiability in voting systems: methods, developments and trends
- Paillier-based publicly verifiable (non-interactive) secret sharing
- Identification protocols and signature schemes based on supersingular isogeny problems
- Identification scheme and forward-secure signature in identity-based setting from isogenies
- Divisible On-Line/Off-Line Signatures
- Combined schemes for signature and encryption: the public-key and the identity-based setting
- Rogue-key attacks on the multi-designated verifiers signature scheme
- 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
- Scalable multi-party private set-intersection
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- A new NP-complete problem and public-key identification
- Verification protocols with sub-linear communication for polynomial matrix operations
- On the (In)security of Kilian-based SNARGs
- A universally composable non-interactive aggregate cash system
- On the Portability of Generalized Schnorr Proofs
- Fast two-party signature for upgrading ECDSA to two-party scenario easily
- Unifying Zero-Knowledge Proofs of Knowledge
- How traveling salespersons prove their identity
- Prepaid electronic cheques using public-key certificates
- Anonymous counting tokens
- Bicameral and auditably private signatures
- Fiat-Shamir security of FRI and related SNARKs
- Generic security of the SAFE API and its applications
- Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines
- Predicate aggregate signatures and applications
- Practical round-optimal blind signatures in the ROM from standard assumptions
- Sigma protocols from verifiable secret sharing and their applications
- Threshold structure-preserving signatures
- Candidate iO from homomorphic encryption schemes
- Salvaging Merkle-Damgård for Practical Applications
- A composable security treatment of ECVRF and batch verifications
- Cryptology in the Classroom: Analyzing a Zero-Knowledge Protocol
- Access with pseudonyms
- Improved identification schemes based on error-correcting codes
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
- MinRank in the head. Short signatures from zero-knowledge proofs
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Anonymous tokens with stronger metadata bit hiding from algebraic MACs
- Anamorphic signatures: secrecy from a dictator who only permits authentication!
- Analysis of the security of the PSSI problem and cryptanalysis of the Durandal signature scheme
- \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist
- Take your MEDS: digital signatures from matrix code equivalence
- The power of undirected rewindings for adaptive security
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Efficient NIZKs and signatures from commit-and-open protocols in the QROM
- Parallel Hashing via List Recoverability
- A random oracle for all of us
- Adaptive proofs have straightline extractors (in the random oracle model)
- A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies
- A Suite of Non-pairing ID-Based Threshold Ring Signature Schemes with Different Levels of Anonymity (Extended Abstract)
- 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
- Digital friend-or-foe authentication
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \(\Sigma\)-protocols
- Security proofs for identity-based identification and signature schemes
- Time- and space-efficient arguments from groups of unknown order
- scientific article; zbMATH DE number 1857533 (Why is no real title available?)
- Bit commitment using pseudorandomness
- Logarithmic-size ring signatures with tight security from the DDH assumption
- The pseudorandom oracle model and ideal obfuscation
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
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)
