Bit security as cost to demonstrate advantage

DOI10.62056/AN5TXOL7MaRDI QIDQ7318548zbMATH OpenFDO

Authors Keewoo Lee

Publication date 25 August 2026

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/AN5TXOL7

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A concrete security treatment of symmetric encryption
• A decade of lattice cryptography
• A Pseudorandom Generator from any One-way Function
• Advances in Cryptology - CRYPTO 2003
• Advances in cryptology -- ASIACRYPT 2021. 27th international conference on the theory and application of cryptology and information security, Singapore, December 6--10, 2021. Proceedings. Part III
• Another look at non-uniformity
• Bit security as computational cost for winning games with high probability
• Cryptographic assumptions: a position paper
• Decisional second-preimage resistance: when does SPR imply PRE?
• Enhanced lattice-based signatures on reconfigurable hardware
• Foundations of Cryptography
• Gaussian sampling over the integers: efficient, generic, constant-time
• 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
• On lattices, learning with errors, random linear codes, and cryptography
• On the bit security of cryptographic primitives
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Unified view for notions of bit security

Cited in

(1)

• Tighter bit-security bounds in quantum key search via the Chebyshev distance

This page was built for publication: Bit security as cost to demonstrate advantage

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