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)- Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
- Triply adaptive UC NIZK
- Compact E-Cash and Simulatable VRFs Revisited
- On the Security of Online/Offline Signatures and Multisignatures from ACISP’06
- Verifiable elections that scale for free
- Identity-based signature and extended forking algorithm in the multivariate quadratic setting
- Implicit zero-knowledge arguments and applications to the malicious setting
- The hunting of the SNARK
- Interactive oracle proofs
- Group encryption: full dynamicity, message filtering and code-based instantiation
- A new NP-complete problem and public-key identification
- Secure reliable multicast protocols in a WAN
- Efficient public-key cryptography with bounded leakage and tamper resilience
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Verification protocols with sub-linear communication for polynomial matrix operations
- Scalable zero knowledge via cycles of elliptic curves
- 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
- New realizations of efficient and secure private set intersection protocols preserving fairness
- 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
- Succinct arguments in the quantum random oracle model
- Formalising \(\varSigma\)-protocols and commitment schemes using crypthol
- Two-round man-in-the-middle security from LPN
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- LESS is more: code-based signatures without syndromes
- Threshold ring signatures: new definitions and post-quantum security
- Efficient fully secure computation via distributed zero-knowledge proofs
- Secure MPC: laziness leads to GOD
- Identification protocols and signature schemes based on supersingular isogeny problems
- 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
- Scalable multi-party private set-intersection
- Fast Reed-Solomon interactive oracle proofs of proximity
- Inner-product functional encryption from random linear codes: trial and challenges
- New number-theoretic cryptographic primitives
- Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications
- Escrow free attribute-based signature with self-revealability
- On the tightness of forward-secure signature reductions
- Storing and retrieving secrets on a blockchain
- SCRAPE: scalable randomness attested by public entities
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
- Efficient NIZKs and signatures from commit-and-open protocols in the QROM
- A lattice-based group signature scheme with verifier-local revocation
- Secret, verifiable auctions from elections
- Post-quantum ID-based ring signatures from symmetric-key primitives
- 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
- Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures
- From Identification to Signatures, Tightly: A Framework and Generic Transforms
- Traceable ring signatures: general framework and post-quantum security
- Tighter Reductions for Forward-Secure Signature Schemes
- Compact ring signatures from learning with errors
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
- Computational integrity with a public random string from quasi-linear PCPs
- Tightly secure ring signatures in the standard model
- Group signatures with user-controlled and sequential linkability
- How to sample a discrete Gaussian (and more) from a random oracle
- A gapless code-based hash proof system based on RQC and its applications
- Improving the efficiency of report and trace ring signatures
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- A New Dynamic Code-Based Group Signature Scheme
- A gapless post-quantum hash proof system in the Hamming metric
- Multi-theorem Fiat-Shamir transform from correlation-intractable hash functions
- 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)
- How (not) to simulate PLONK
- On the concrete security of non-interactive FRI
- An improved threshold homomorphic cryptosystem based on class groups
- Instantiating the hash-then-evaluate paradigm: strengthening PRFs, PCFs, and OPRFs
- Succinct non-subsequence arguments
- On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
- A note on non-interactive zero-knowledge from CDH
- Algebraic reductions of knowledge
- A detailed analysis of Fiat-Shamir with aborts
- \textsf{DualMS}: efficient lattice-based two-round multi-signature with trapdoor-free simulation
- Correlation intractability and SNARGs from sub-exponential DDH
- On the impossibility of algebraic NIZK in pairing-free groups
- Lattice-based timed cryptography
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)
