A closer look at multiple forking: leveraging (in)dependence for a tighter bound
From MaRDI portal
Publication:289922
DOI10.1007/S00453-015-9997-6zbMATH Open1408.94930OpenAlexW2474529091MaRDI QIDQ289922FDOQ289922
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
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
- Security arguments for digital signatures and blind signatures
- Security Proofs for Signature Schemes
- Advances in Cryptology - EUROCRYPT 2004
- Efficient signature generation by smart cards
- The knowledge complexity of interactive proof-systems
- Zero-knowledge argument for simultaneous discrete logarithms
- 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
- Secure proxy signature schemes for delegation of signing rights
- Title not available (Why is that?)
- Galindo-Garcia identity-based signature revisited
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)
