A note on security proofs in the generic model

DOI10.1007/3-540-44448-3_35MaRDI QIDQ2707440zbMATH OpenFDO

Authors Marc Fischlin

Publication date 6 March 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44448-3_35

zbMATH Keywords

Baby-Step-Giant-Stepcyclic groupdiscrete-logarithmPohlig-Hellman

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Models and Proofs of Protocol Security: A Progress Report
• Another look at provable security. (Abstract)
• scientific article; zbMATH DE number 7301460
• Mechanizing Mathematical Reasoning
• Certified security proofs of cryptographic protocols in the computational model: an application to intrusion resilience
• Model checking indistinguishability of randomized security protocols
• Abstract interpretation for proving secrecy properties in security protocols
• Proved generation of implementations from computationally secure protocol specifications
• Modelchecking safety properties in randomized security protocols

Cited in

(21)

• The Discrete Logarithm problem with preprocessing
• Does Fiat-Shamir require a cryptographic hash function?
• On the multi-user security of short Schnorr signatures with preprocessing
• On the analysis of cryptographic assumptions in the generic ring model
• Enhancing the security of perfect blind DL-signatures
• Generic groups, collision resistance, and ECDSA
• Succinct functional commitment for a large class of arithmetic circuits
• Security of DL-encryption and signatures against generic attacks -- a survey
• A shuffle argument secure in the generic model
• Efficiency limitations for -protocols for group homomorphisms
• Lower bounds on generic algorithms in groups
• Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
• scientific article; zbMATH DE number 2086711 (Why is no real title available?)
• scientific article; zbMATH DE number 7301460 (Why is no real title available?)
• On the Equivalence of Generic Group Models
• Cryptography and Coding
• LATIN 2004: Theoretical Informatics
• Generic models for group actions
• To label, or not to label (in generic groups)
• Algebraic group model with oblivious sampling
• The structured generic-group model

This page was built for publication: A note on security proofs in the generic model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2707440)