How To Prove Yourself: Practical Solutions to Identification and Signature Problems
From MaRDI portal
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
- On linear equivalence, canonical forms, and digital signatures
- 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
- Actively secure half-gates with minimum overhead under duplex networks
- 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
- Stateless deterministic multi-party EdDSA signatures with low communication
- Arctic: lightweight and stateless threshold Schnorr signatures
- On graphs of incremental proofs of sequential work
- \(\Pi\): a unified framework for computational verifiable secret sharing
- PRISM: simple and compact identification and signatures from large prime degree isogenies
- Finally! A compact lattice-based threshold signature
- A framework for group action-based multi-signatures and applications to LESS, MEDS, and ALTEQ
- Universally composable non-interactive zero-knowledge from sigma protocols via a new straight-line compiler
- Split prover zero-knowledge SNARKs
- The security of hash-and-sign with retry against superposition attacks
- Watermarkable and zero-knowledge verifiable delay functions from any proof of exponentiation
- 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
- From one-time to two-round reusable multi-signatures without nested forking
- 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
- Revisiting generic conversion from non-adaptive to adaptively secure IBS: tightness and an extension
- Registered FE beyond predicates: (attribute-based) linear functions and more
- 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 guide to the design of digital signatures based on cryptographic group actions
- 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
- Timed secret sharing
- Compute, but verify: efficient multiparty computation over authenticated inputs
- Code-based zero-knowledge from VOLE-in-the-head and their applications: simpler, faster, and smaller
- FLI: folding lookup instances
- 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
- SQIPrime: a dimension 2 variant of SQISignHD with non-smooth challenge isogenies
- SQIsign2D-West. The fast, the small, and the safer
- Sigma protocols from verifiable secret sharing and their applications
- Threshold structure-preserving signatures
- SQIsign2D-East: a new signature scheme using 2-dimensional isogenies
- Ideal-to-isogeny algorithm using 2-dimensional isogenies and its application to SQIsign
- Tiresias: large scale, UC-secure threshold Paillier
- Dual support decomposition in the head: shorter signatures from Rank SD and MinRank
- The code equivalence problem and its applications to cryptography
- 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
- Single trace side-channel attack on the MPC-in-the-head framework
- Access with pseudonyms
- Current paradigms for construction of lattice-based digital signature schemes
- 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
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)
