A closer look at multiple forking: leveraging (in)dependence for a tighter bound

DOI10.1007/s00453-015-9997-6zbMath1408.94930OpenAlexW2474529091MaRDI QIDQ289922

Chethan Kamath, Sanjit Chatterjee

Publication date: 31 May 2016

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-015-9997-6

zbMATH Keywords

cryptographytightnessprovable securityforking lemmamultiple forking lemmarandom oracle

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Secure proxy signature schemes for delegation of signing rights
• Efficient signature generation by smart cards
• Security arguments for digital signatures and blind signatures
• Zero-knowledge argument for simultaneous discrete logarithms
• Security Proofs for Signature Schemes
• On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• A Schnorr-Like Lightweight Identity-Based Signature Scheme
• The knowledge complexity of interactive proof-systems
• Galindo-Garcia Identity-Based Signature Revisited
• Advances in Cryptology - EUROCRYPT 2004