On the bit security of cryptographic primitives
From MaRDI portal
Publication:1648779
DOI10.1007/978-3-319-78381-9_1zbMath1423.94090OpenAlexW2795300525MaRDI QIDQ1648779
Michael Walter, Daniele Micciancio
Publication date: 9 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78381-9_1
Related Items (14)
Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography ⋮ Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions ⋮ Tighter proofs of CCA security in the quantum random oracle model ⋮ Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem ⋮ Securing approximate homomorphic encryption using differential privacy ⋮ Bit security as computational cost for winning games with high probability ⋮ Bet-or-pass: adversarially robust Bloom filters ⋮ A theoretical framework for the analysis of physical unclonable function interfaces and its relation to the random oracle model ⋮ Ring-based identity based encryption -- asymptotically shorter MPK and tighter security ⋮ Secure pseudorandom bit generators and point sets with low star-discrepancy ⋮ On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments ⋮ Security under message-derived keys: signcryption in iMessage ⋮ Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security ⋮ Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
Cites Work
- Unnamed Item
- No double discount: condition-based simultaneity yields limited gain
- On expected constant-round protocols for Byzantine agreement
- Probabilistic encryption
- Thunderella: blockchains with optimistic instant confirmation
- The Bitcoin backbone protocol with chains of variable difficulty
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Gaussian sampling over the integers: efficient, generic, constant-time
- The sleepy model of consensus
- Fast Paxos
- Sharper bounds in lattice-based cryptography using the Rényi divergence
- A Characterization of Eventual Byzantine Agreement
- Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
- Non-uniform Cracks in the Concrete: The Power of Free Precomputation
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions
- The Bitcoin Backbone Protocol: Analysis and Applications
- How to Obfuscate Programs Directly
- Message Authentication Codes from Unpredictable Block Ciphers
- Bosco: One-Step Byzantine Asynchronous Consensus
- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
- A Pseudorandom Generator from any One-way Function
- Foundations of Cryptography
- Early Detection of Message Forwarding Faults
- Foundations of Cryptography
- How to use indistinguishability obfuscation
- Enhanced Lattice-Based Signatures on Reconfigurable Hardware
- Analysis of the Blockchain Protocol in Asynchronous Networks
- FruitChains
This page was built for publication: On the bit security of cryptographic primitives
