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

DOI10.1007/S00453-015-9997-6MaRDI QIDQ289922zbMATH OpenOpenAlexFDO

Authors Sanjit Chatterjee, Chethan Kamath

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

cryptographyprovable securitytightnessforking lemmamultiple forking lemmarandom oracle

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Bounds and Approximations for Overheads in the Time to Join Parallel Forks
• A Generalization of Forking
• scientific article; zbMATH DE number 3843729
• Meager forking and m-independence
• Approximate analysis of a closed fork/join model
• Fork-Join program response time on multiprocessors with exchangeable join
• Fork-join and redundancy systems with heavy-tailed job sizes

Cites work

• scientific article; zbMATH DE number 708798 (Why is no real title available?)
• A Schnorr-Like Lightweight Identity-Based Signature Scheme
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Advances in Cryptology - EUROCRYPT 2004
• Efficient signature generation by smart cards
• Galindo-Garcia identity-based signature revisited
• On the exact security of Schnorr-type signatures in the random oracle model
• Secure proxy signature schemes for delegation of signing rights
• Security arguments for digital signatures and blind signatures
• Security proofs for signature schemes
• The knowledge complexity of interactive proof-systems
• Zero-knowledge argument for simultaneous discrete logarithms

Cited in

(1)

• Multi-splitting forking based modular security of signatures in multivariate quadratic setting

This page was built for publication: A closer look at multiple forking: leveraging (in)dependence for a tighter bound

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