On the bit security of cryptographic primitives
From MaRDI portal
Publication:1648779
DOI10.1007/978-3-319-78381-9_1zbMATH Open1423.94090OpenAlexW2795300525MaRDI QIDQ1648779FDOQ1648779
Authors: Daniele Micciancio, Michael Walter 
Publication date: 9 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78381-9_1
Recommendations
- On the bit security of the Diffie-Hellman key
- scientific article; zbMATH DE number 1588479
- On the design of cryptographic primitives
- On the bit security of the weak Diffie-Hellman problem
- scientific article; zbMATH DE number 1759791
- On the bit security of elliptic curve Diffie-Hellman
- On the circular security of bit-encryption
- On the security of the Merkle- Hellman cryptographic scheme (Corresp.)
Cites Work
- Probabilistic encryption
- The exact security of digital signatures -- how to sign with RSA and Rabin
- A Pseudorandom Generator from any One-way Function
- Foundations of Cryptography
- Foundations of Cryptography
- How to use indistinguishability obfuscation
- No double discount: condition-based simultaneity yields limited gain
- Fast Paxos
- Bosco: One-Step Byzantine Asynchronous Consensus
- Message Authentication Codes from Unpredictable Block Ciphers
- A characterization of eventual Byzantine agreement
- The Bitcoin Backbone Protocol: Analysis and Applications
- On expected constant-round protocols for Byzantine agreement
- How to obfuscate programs directly
- Time space tradeoffs for attacks against one-way functions and PRGs
- Non-uniform cracks in the concrete: the power of free precomputation
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- The sleepy model of consensus
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- Analysis of the Blockchain Protocol in Asynchronous Networks
- Thunderella: blockchains with optimistic instant confirmation
- The Bitcoin backbone protocol with chains of variable difficulty
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- FruitChains: a fair blockchain
- Gaussian sampling over the integers: efficient, generic, constant-time
- Sharper bounds in lattice-based cryptography using the Rényi divergence
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions
- Title not available (Why is that?)
- Early Detection of Message Forwarding Faults
- Enhanced lattice-based signatures on reconfigurable hardware
Cited In (31)
- Securing approximate homomorphic encryption using differential privacy
- Bit security as computational cost for winning games with high probability
- Title not available (Why is that?)
- Computing OR on a randomized fixed adversary CRCW PRAM
- On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments
- Bet-or-pass: adversarially robust Bloom filters
- Efficient updatable public-key encryption from lattices
- Unified view for notions of bit security
- DRAT-based bit-vector proofs in CVC4
- Secure pseudorandom bit generators and point sets with low star-discrepancy
- Security of most significant bits of \(g^{x^{2}}\).
- Another look at tightness. II: Practical issues in cryptography
- Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
- Concise and tight security analysis of the Bennett–Brassard 1984 protocol with finite key lengths
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
- Tighter proofs of CCA security in the quantum random oracle model
- Primitivity of PRESENT and other lightweight ciphers
- Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
- Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security
- Security under message-derived keys: signcryption in iMessage
- Ring-based identity based encryption -- asymptotically shorter MPK and tighter security
- SoK: learning with errors, circular security, and fully homomorphic encryption
- On the Security of the Schnorr Scheme using Preprocessing
- Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
- Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes
- A theoretical framework for the analysis of physical unclonable function interfaces and its relation to the random oracle model
- Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem
- On the Bit Security of NTRUEncrypt
- Bit Security of the CDH Problems over Finite Fields
- Non-uniform cracks in the concrete: the power of free precomputation
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
This page was built for publication: On the bit security of cryptographic primitives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648779)
