How To Prove Yourself: Practical Solutions to Identification and Signature Problems
From MaRDI portal
(Redirected from Publication:3777940)
Recommendations
Cited in
(only showing first 100 items - show all)- Ring signatures: Stronger definitions, and constructions without random oracles
- Security proofs for identity-based identification and signature schemes
- Filling the gap between voters and cryptography in e-voting
- Zero-knowledge proofs of identity
- Efficient signature generation by smart cards
- An almost-constant round interactive zero-knowledge proof
- Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications
- Improved identification schemes based on error-correcting codes
- Batch RSA
- Improving the exact security of digital signature schemes
- On the hardness of the computational ring-LWR problem and its applications
- Fiat-Shamir for highly sound protocols is instantiable
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Random oracles and non-uniformity
- Scalable zero knowledge via cycles of elliptic curves
- The hunting of the SNARK
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- CSIDH: an efficient post-quantum commutative group action
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- On the tightness of forward-secure signature reductions
- On the impossibility of structure-preserving deterministic primitives
- A lattice-based group signature scheme with verifier-local revocation
- Secret, verifiable auctions from elections
- Zero-knowledge argument for simultaneous discrete logarithms
- A new NP-complete problem and public-key identification
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Verification protocols with sub-linear communication for polynomial matrix operations
- New number-theoretic cryptographic primitives
- Formalising \(\varSigma\)-protocols and commitment schemes using crypthol
- Traceable ring signatures: general framework and post-quantum security
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Candidate iO from homomorphic encryption schemes
- Security of hedged Fiat-Shamir signatures under fault attacks
- Transparent SNARKs from DARK compilers
- SPARKs: succinct parallelizable arguments of knowledge
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices
- Continuous verifiable delay functions
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Signatures from sequential-OR proofs
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Statistical Zaps and new oblivious transfer protocols
- Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes
- Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512
- Threshold schemes from isogeny assumptions
- Threshold ring signatures: new definitions and post-quantum security
- Linearly-homomorphic signatures and scalable mix-nets
- Efficient redactable signature and application to anonymous credentials
- Non-interactive zero knowledge from sub-exponential DDH
- Classical vs quantum random oracles
- 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
- Fully secure ABE with outsourced decryption against chosen ciphertext attack
- An improvement of multi-exponentiation with encrypted bases argument: smaller and faster
- Banquet: short and fast signatures from AES
- Group signatures with user-controlled and sequential linkability
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- On publicly-accountable zero-knowledge and small shuffle arguments
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Identity-based authenticated encryption with identity confidentiality
- A new identity-based multivariate signature scheme
- Post-quantum ID-based ring signatures from symmetric-key primitives
- A gapless code-based hash proof system based on RQC and its applications
- Two-sided malicious security for private intersection-sum with cardinality
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Interactive proofs for social graphs
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Blind polynomial evaluation and data trading
- Unlinkable and invisible \(\gamma \)-sanitizable signatures
- Partially structure-preserving signatures: lower bounds, constructions and more
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- Cryptanalysis of the binary permuted kernel problem
- LESS-FM: fine-tuning signatures from the code equivalence problem
- On removing rejection conditions in practical lattice-based signatures
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
- Compact ring signatures from learning with errors
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- Subquadratic SNARGs in the random oracle model
- A compressed \(\varSigma \)-protocol theory for lattices
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
- Tight state-restoration soundness in the algebraic group model
- Succinct non-interactive arguments via linear interactive proofs
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- Time- and space-efficient arguments from groups of unknown order
- Does Fiat-Shamir require a cryptographic hash function?
- Composition with knowledge assumptions
- Non-interactive batch arguments for NP from standard assumptions
- 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
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)
