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 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
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- A new key recovery attack on a code-based signature from the Lyubashevsky framework
- Sampling from arbitrary centered discrete Gaussians for lattice-based cryptography
- Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
- General linear group action on tensors: a candidate for post-quantum cryptography
- An efficient publicly verifiable and proactive secret sharing scheme
- A practical group signature scheme based on rank metric
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- On publicly-accountable zero-knowledge and small shuffle arguments
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- Lossy identification schemes from decisional RSA
- Naor-Yung Paradigm with Shared Randomness and Applications
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- Composition with knowledge assumptions
- Does Fiat-Shamir require a cryptographic hash function?
- Non-interactive batch arguments for NP from standard assumptions
- Improving speed and security in updatable encryption schemes
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
- Speeding-up verification of digital signatures
- Sanitizable Signatures Revisited
- Asynchronous Multi-Party Computation with Quadratic Communication
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Multikey fully homomorphic encryption and applications
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- Blind polynomial evaluation and data trading
- Candidate iO from homomorphic encryption schemes
- Lattice-based e-cash, revisited
- 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
- An efficient self-blindable attribute-based credential scheme
- On removing rejection conditions in practical lattice-based signatures
- How to challenge and cast your e-vote
- \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
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Practical statistically-sound proofs of exponentiation in any group
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
- Naor-Yung paradigm with shared randomness and applications
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes
- Provably secure threshold paillier encryption based on hyperplane geometry
- Identity-based group encryption
- On the (In)security of Kilian-based SNARGs
- MinRank in the head. Short signatures from zero-knowledge proofs
- Take your MEDS: digital signatures from matrix code equivalence
- A new identity-based multivariate signature scheme
- Succinct non-interactive arguments via linear interactive proofs
- Improved zero-knowledge argument of encrypted extended permutation
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Dynamic universal accumulator with batch update over bilinear groups
- Actively secure garbled circuits with constant communication overhead in the plain model
- Cryptanalysis of a rank-based signature with short public keys
- Layering quantum-resistance into classical digital signature algorithms
- Asymmetric group message franking: definitions and constructions
- End-to-end secure messaging with traceability only for illegal content
- Time- and space-efficient arguments from groups of unknown order
- Revisiting BBS signatures
- Short signatures from regular syndrome decoding in the head
- Two-sided malicious security for private intersection-sum with cardinality
- A generic transform from multi-round interactive proof to NIZK
- On the hardness of the Lee syndrome decoding problem
- An estimator for the hardness of the MQ problem
- Universally composable \(\varSigma \)-protocols in the global random-oracle model
- Spooky interaction and its discontents: compilers for succinct two-message argument systems
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes
- Entanglement Between Hash Encodings and Signatures from ID Schemes with Non-binary Challenges: A Case Study on Lightweight Code-Based Signatures
- Fiat-Shamir signatures based on module-NTRU
- Logarithmic-size ring signatures with tight security from the DDH assumption
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)
