Extended security arguments for signature schemes

DOI10.1007/s10623-014-0009-7zbMath1355.94052OpenAlexW1730077839MaRDI QIDQ5963366

Pascal Véron, Sidi Mohamed El Yousfi Alaoui, Pierre-Louis Cayrel, David Galindo, Özgür Dagdelen

Publication date: 19 February 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01313619/file/main.pdf

zbMATH Keywords

signature schemescode-based cryptographyFiat-Shamirforking lemmaidentification schemesmultivariate cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

The return of the SDitH ⋮ Code-Based Signature Schemes from Identification Protocols in the Rank Metric ⋮ A novel 3-pass identification scheme and signature scheme based on multivariate quadratic polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Security arguments for digital signatures and blind signatures
• A new NP-complete problem and public-key identification
• The Fiat–Shamir Transformation in a Quantum World
• Security Proofs for Signature Schemes
• Extended Security Arguments for Signature Schemes
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem
• Random Oracles in a Quantum World
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• A new identification scheme based on syndrome decoding
• The knowledge complexity of interactive proof-systems
• Why “Fiat-Shamir for Proofs” Lacks a Proof
• Improved Zero-Knowledge Identification with Lattices
• A Second Look at Fischlin’s Transformation
• Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors

This page was built for publication: Extended security arguments for signature schemes