Security Proofs for Signature Schemes
From MaRDI portal
Publication:2876917
DOI10.1007/3-540-68339-9_33zbMath1304.94106OpenAlexW2166462813WikidataQ56921570 ScholiaQ56921570MaRDI QIDQ2876917
Jacques Stern, David Pointcheval
Publication date: 20 August 2014
Published in: Advances in Cryptology — EUROCRYPT ’96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-68339-9_33
Related Items (only showing first 100 items - show all)
Fiat-Shamir transformation of multi-round interactive proofs ⋮ Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions ⋮ Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head ⋮ \textsf{DualMS}: efficient lattice-based two-round multi-signature with trapdoor-free simulation ⋮ Practical algorithm substitution attack on extractable signatures ⋮ Threshold Schnorr with stateless deterministic signing from standard assumptions ⋮ \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments ⋮ Generic construction for tightly-secure signatures from discrete log ⋮ SoK: how (not) to design and implement post-quantum cryptography ⋮ Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures ⋮ On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness ⋮ Identity-based undetachable digital signature for mobile agents in electronic commerce ⋮ A closer look at multiple forking: leveraging (in)dependence for a tighter bound ⋮ Limits on the usefulness of random oracles ⋮ A signature scheme with non-repudiation ⋮ Hidden Collisions on DSS ⋮ Security of 2t-Root Identification and Signatures ⋮ An Efficient Privacy-Preserving E-coupon System ⋮ Fast generators for the Diffie-Hellman key agreement protocol and malicious standards ⋮ Interactive Oracle Proofs ⋮ Certificateless signature: a new security model and an improved generic construction ⋮ Provable security of digital signatures in the tamper-proof device model ⋮ Identity-based signature scheme based on quadratic residues ⋮ A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption ⋮ An efficient multi-receipt mechanism for uncoercible anonymous electronic voting ⋮ Identity based signature scheme based on cubic residues ⋮ Certificate-based signcryption with enhanced security features ⋮ Efficient arbitrated quantum signature and its proof of security ⋮ Reusing nonces in Schnorr signatures (and keeping it secure...) ⋮ Logarithmic-size ring signatures with tight security from the DDH assumption ⋮ Improved signature schemes for secure multi-party computation with certified inputs ⋮ A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme ⋮ SNARGs for P from sub-exponential DDH and QR ⋮ On the multi-user security of short Schnorr signatures with preprocessing ⋮ Certificateless aggregate signature scheme secure against fully chosen-key attacks ⋮ A multivariate based threshold ring signature scheme ⋮ Succinct arguments in the quantum random oracle model ⋮ On the (In)security of Kilian-based SNARGs ⋮ The random oracle model: a twenty-year retrospective ⋮ On tightly-secure (linkable) ring signatures ⋮ Promise $$\varSigma $$-Protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on Class Groups ⋮ The One-More Discrete Logarithm Assumption in the Generic Group Model ⋮ Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems ⋮ From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures ⋮ On tight security proofs for Schnorr signatures ⋮ An Efficient Strong Key-Insulated Signature Scheme and Its Application ⋮ Improved straight-line extraction in the random oracle model with applications to signature aggregation ⋮ Fiat-Shamir transformation of multi-round interactive proofs (Extended version) ⋮ A pairing-free and provably secure certificateless signature scheme ⋮ The power of undirected rewindings for adaptive security ⋮ Anamorphic signatures: secrecy from a dictator who only permits authentication! ⋮ \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist ⋮ A public key cryptosystem based on three new provable problems ⋮ Identity-based signature and extended forking algorithm in the multivariate quadratic setting ⋮ Ternary forking lemma and its application to the analysis of one code-based signature ⋮ A round-optimal three-party ID-based authenticated key agreement protocol ⋮ ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing ⋮ A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks ⋮ Strongly secure certificateless signature scheme supporting batch verification ⋮ Provably secure certificate-based signature scheme without pairings ⋮ A New Efficient Threshold Ring Signature Scheme Based on Coding Theory ⋮ Provably secure and efficient proxy signature with untrustworthy proxy signer ⋮ Subliminal Hash Channels ⋮ A provably secure short signature scheme based on discrete logarithms ⋮ Tightly secure ring signatures in the standard model ⋮ Authenticated Key Agreement Protocol Based on Provable Secure Cryptographic Functions ⋮ New designing of cryptosystems based on quadratic fields ⋮ Continuous leakage-resilient certificate-based signcryption scheme and application in cloud computing ⋮ Removing the Strong RSA Assumption from Arguments over the Integers ⋮ Self-generated-certificate public key encryption without pairing and its application ⋮ Enhancing the security of perfect blind DL-signatures ⋮ A fair and efficient solution to the socialist millionaires' problem ⋮ Lower bounds for non-black-box zero knowledge ⋮ A Suite of Non-pairing ID-Based Threshold Ring Signature Schemes with Different Levels of Anonymity (Extended Abstract) ⋮ Proxy blind multi-signature scheme without a secure channel ⋮ Improved Bounds on Security Reductions for Discrete Log Based Signatures ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Improved OR-Composition of Sigma-Protocols ⋮ Extended security arguments for signature schemes ⋮ \(k\)-critical graphs in \(P_5\)-free graphs ⋮ Realizing Hash-and-Sign Signatures under Standard Assumptions ⋮ Classical vs quantum random oracles ⋮ Public-coin statistical zero-knowledge batch verification against malicious verifiers ⋮ Efficient range proofs with transparent setup from bounded integer commitments ⋮ A paid message forwarding scheme based on social network ⋮ Fuzzy Signatures: Relaxing Requirements and a New Construction ⋮ Taxonomical Security Consideration of Authenticated Key Exchange Resilient to Intermediate Computation Leakage ⋮ Characterization of Strongly Secure Authenticated Key Exchanges without NAXOS Technique ⋮ Identity-Based Deterministic Signature Scheme without Forking-Lemma ⋮ Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials ⋮ Indifferentiability of 8-Round Feistel Networks ⋮ On the security of a convertible authenticated encryption ⋮ Designated verifier proxy signature scheme with message recovery ⋮ Digital Signatures ⋮ Lattice-based blind signatures, revisited ⋮ A gapless code-based hash proof system based on RQC and its applications ⋮ Improving the exact security of digital signature schemes ⋮ Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs ⋮ Designated-verifier linkable ring signatures ⋮ An efficient certificateless undeniable signature scheme
This page was built for publication: Security Proofs for Signature Schemes
