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)- Identification scheme and forward-secure signature in identity-based setting from isogenies
- Random oracles and non-uniformity
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- Efficient Traceable Signatures in the Standard Model
- Efficient traceable signatures in the standard model
- A Schnorr-Like Lightweight Identity-Based Signature Scheme
- Identity based identification from algebraic coding theory
- \(k\)-critical graphs in \(P_5\)-free graphs
- Optimal security proofs for signatures from identification schemes
- Extending concurrent signature to multiple parties
- Forward-secure ID based digital signature scheme with forward-secure private key generator
- scientific article; zbMATH DE number 708798 (Why is no real title available?)
- Multi-designated verifiers signatures: anonymity without encryption
- On the computational hardness of the code equivalence problem in cryptography
- A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
- Identity-based authenticated encryption with identity confidentiality
- Efficient signature generation by smart cards
- Tight security for the generic construction of identity-based signature (in the multi-instance setting)
- A Suite of Non-pairing ID-Based Threshold Ring Signature Schemes with Different Levels of Anonymity (Extended Abstract)
- Hash Functions from Sigma Protocols and Improvements to VSH
- Privacy and verifiability in voting systems: methods, developments and trends
- An Efficient On-Line/Off-Line Signature Scheme without Random Oracles
- Several practical protocols for authentication and key exchange
- Paillier-based publicly verifiable (non-interactive) secret sharing
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- Adaptively secure threshold symmetric-key encryption
- Efficient RSA key generation and threshold Paillier in the two-party setting
- On best-possible obfuscation
- On the amortized complexity of zero-knowledge protocols
- Efficient generic on-line/off-line (threshold) signatures without key exposure
- Fully leakage-resilient signatures
- How to obtain full privacy in auctions
- Hash function requirements for Schnorr signatures
- Ring signatures: Stronger definitions, and constructions without random oracles
- Zero-knowledge proofs of identity
- On server trust in private proxy auctions
- Secure electronic bills of lading: Blind counts and digital signatures
- Secure Obfuscation of Encrypted Verifiable Encrypted Signatures
- Twin-Beth: security under active and concurrent attacks for the Beth identity-based identification scheme
- Identity-based cryptosystems and signature schemes
- Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model
- A correction to a code-based blind signature scheme
- Blind attribute-based encryption and oblivious transfer with fine-grained access control
- Generic security-amplifying methods of ordinary digital signatures
- On the connection between leakage tolerance and adaptive security
- Security proofs for identity-based identification and signature schemes
- Two Notes on the Security of Certificateless Signatures
- Zero-knowledge argument for simultaneous discrete logarithms
- Strongly unforgeable ring signature scheme from lattices in the standard model
- Tightly secure signatures from lossy identification schemes
- Verifiable Decryption for Fully Homomorphic Encryption
- Salvaging Merkle-Damgård for Practical Applications
- \(k\)-anonymous data collection
- Bounded tamper resilience: how to go beyond the algebraic barrier
- One-time signatures and chameleon hash functions
- Lattice-Based Identification Schemes Secure Under Active Attacks
- scientific article; zbMATH DE number 1796970 (Why is no real title available?)
- Group signatures with decentralized tracing
- Public Verifiability from Pairings in Secret Sharing Schemes
- Efficient Non-interactive Range Proof
- A fair and efficient solution to the socialist millionaires' problem
- Combined schemes for signature and encryption: the public-key and the identity-based setting
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Bit commitment using pseudorandomness
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
- A code-based group signature scheme
- Improving the exact security of digital signature schemes
- Limits on the usefulness of random oracles
- Lower bounds for non-black-box zero knowledge
- Leakproof secret sharing protocols with applications to group identification scheme
- Zero-knowledge identification scheme based on Weil pairing
- Secure identification and QKD in the bounded-quantum-storage model
- Forward-secure multisignature and blind signature schemes
- Identity-based partially blind signature in the standard model for electronic cash
- A post-quantum round-optimal oblivious PRF from isogenies
- Traceable ring signatures from group actions: logarithmic, flexible, and quantum resistant
- Efficient transparent polynomial commitments for zk-SNARKs
- stoRNA: stateless transparent proofs of storage-time
- Group encryption: full dynamicity, message filtering and code-based instantiation
- High weight code-based signature scheme from QC-LDPC codes
- Auditable attribute-based credentials scheme and its application in contact tracing
- Building MPCitH-based signatures from MQ, MinRank, and rank SD
- Biscuit: new MPCitH signature scheme from structured multivariate polynomials
- Exploring SIDH-based signature parameters
- \textsf{FuLeeca}: a Lee-based signature scheme
- Code-based secret handshake scheme, revisited
- Efficient zero-knowledge arguments and digital signatures \textit{via} sharing conversion \textit{in the head}
- Sequential half-aggregation of lattice-based signatures
- A review of mathematical and computational aspects of CSIDH algorithms
- How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach
- Non-interactive zero-knowledge functional proofs
- The relationship between idealized models under computationally bounded adversaries
- Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting
- Towards zero knowledge argument for double discrete logarithm with constant cost
- Benchmarking the setup of updatable zk-SNARKs
- Digital friend-or-foe authentication
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \(\Sigma\)-protocols
- Verifiable isogeny walks: towards an isogeny-based postquantum VDF
- SPANSE: combining sparsity with density for efficient one-time code-based digital signatures
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)
