A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Quantum Security of NMAC and Related Constructions
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
We prove the security of NMAC, HMAC, AMAC, and the cascade construction with fixed input-length as quantum-secure pseudorandom functions (PRFs). ...
We first show that a quantumsecure PRF is secure against key-recovery attacks, and remains secure under random leakage of the key. ...
We would like to thank the anonymous reviewers of Crypto 2017 for many helpful comments. ...
doi:10.1007/978-3-319-63715-0_10
fatcat:ibvg5gd6tjec3okyd6wtbkfpsa
Another Look at Tightness II: Practical Issues in Cryptography
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
How to deal with large tightness gaps in security proofs is a vexing issue in cryptography. ...
We discuss nontightness in connection with complexity leveraging, HMAC, lattice-based cryptography, identity-based encryption, and hybrid encryption. ...
Acknowledgments We wish to thank Greg Zaverucha for extensive help with Appendix A as well as useful comments on the other sections, Michael Naehrig for reviewing and commenting on §6, Somindu C. ...
doi:10.1007/978-3-319-61273-7_3
fatcat:auyw65hh2rfh3k3hphhrf6mcra
Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
For encryption, we define security under quantum chosen ciphertext attacks and present both public-key and symmetric-key constructions. ...
We initiate the study of quantum-secure digital signatures and quantum chosen ciphertext security. ...
The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of DARPA ...
doi:10.1007/978-3-642-40084-1_21
fatcat:3ovse3btfjg5xon7tcv46csq2m
A Unified Framework For Quantum Unforgeability
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We develop a general and parameterised quantum game-based security model unifying unforgeability for both classical and quantum constructions allowing us for the first time to present a complete quantum ...
On the other hand, we show that PRF is sufficient for constructing a selective unforgeable classical primitive against full quantum adversaries. ...
[Quantum-Secure Pseudorandom Functions(PRF): [26] ] Let K, X , Y be the key space, the domain and range respectively, all implicitly depending on the security parameter λ. ...
arXiv:2103.13994v2
fatcat:7wdgkknnijeiljtss772a2rohi
A Note on the Post-Quantum Security of (Ring) Signatures
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
This work revisits the security of classical signatures and ring signatures in a quantum world. ...
We present two short signature schemes achieving this notion: one is in the quantum random oracle model, assuming quantum hardness of SIS; and the other is in the plain model, assuming quantum hardness ...
Fang Song and Aaram Yun. Quantum security of NMAC and related constructions - PRF domain
extension against quantum attacks. In Katz and Shacham [KS17], pages 283–309. 2
TSS+ 18. ...
arXiv:2112.06078v1
fatcat:potybhcv7nfqbaw4ek5ggiklmu
Saturnin: a suite of lightweight symmetric algorithms for post-quantum security
2020
IACR Transactions on Symmetric Cryptology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Saturnin is a 256-bit block cipher with a 256-bit key and an additional 9-bit parameter for domain separation. ...
In this paper, we specify a new block cipher, Saturnin, and its usage in different modes to provide hashing and authenticated encryption in such a way that we can rigorously argue its security in the post-quantum ...
They are also particularly grateful to Xavier Bonnetain for very helpful discussions and comments, and in particular for an invaluable remark detecting a weakness on a preliminary version of Saturnin. ...
doi:10.13154/tosc.v2020.is1.160-207
dblp:journals/tosc/CanteautDLNPPS20
fatcat:jbovqcc6k5gvtopwgxcmadggd4
Critical perspectives on provable security: Fifteen years of "another look" papers
2019
Advances in Mathematics of Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We give an overview of our critiques of "proofs" of security and a guide to our papers on the subject that have appeared over the past decade and a half. ...
We also provide numerous additional examples and a few updates and errata. 2010 Mathematics Subject Classification: Primary: 94A60. ...
for editorial corrections and comments. ...
doi:10.3934/amc.2019034
fatcat:gpftyd4hxjebfpzdqwdes345na
KEM Combiners
[chapter]
2018
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In light of the recent NIST call for post-quantum secure PKE, the zoo of KEMs that are believed to be secure continues to grow. ...
As building blocks our constructions use cryptographic hash functions and blockciphers. ...
The reason for the last construction not working is that the linearity of the XOR operation allows for conducting related-key attacks on the PRF, and PRFs in general are not immune against such attacks ...
doi:10.1007/978-3-319-76578-5_7
fatcat:bt4zzlp4bfhfbljyze4em2oi5m
Quantum-Access-Secure Message Authentication via Blind-Unforgeability
[chapter]
2020
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
and quantum-query-secure pseudorandom functions. ...
We propose a natural definition of unforgeability against quantum adversaries called blind unforgeability. ...
Several domain-extension schemes, including NMAC (a.k.a. encrypted cascade), HMAC, and AMAC, can transform a fixed-length qPRF to a qPRF that takes variable-length inputs [24] . ...
doi:10.1007/978-3-030-45727-3_27
fatcat:3vdcfx2tyjaxncl4xe6sf3n5le
Quantum-secure message authentication via blind-unforgeability
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Specifically, we demonstrate a function which is secure according to the existing definition by Boneh and Zhandry, but is clearly vulnerable to a quantum forgery attack, whereby a query supported only ...
In this work, we uncover serious shortcomings in existing approaches, and propose a new definition. We then support its viability by a number of constructions and characterizations. ...
We can then invoke a recent result about the quantum-security of domain-extension schemes such as NMAC and HMAC [20] , and obtain variable-length BU-secure MACs from any qPRF. Hash-and-MAC. ...
arXiv:1803.03761v2
fatcat:efmdaf2mkfczfiecwxy2c2hgri
Quantum Lazy Sampling and Game-Playing Proofs for Quantum Indifferentiability
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Game-playing proofs constitute a powerful framework for non-quantum cryptographic security arguments, most notably applied in the context of indifferentiability. ...
Subsequently, we use our game-playing framework to prove quantum indifferentiability of the sponge construction, assuming a random internal function. ...
Acknowledgments The authors thank Gorjan Alagic, Andreas Hülsing and Dominique Unruh for enlightening discussions about the superposition oracle technique. ...
arXiv:1904.11477v4
fatcat:hlqvigznjnhe3bqls7t6t5n6fe
Cryptographic Primitives that Resist Backdooring and Subversion
2020
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
closely related disciplines to new scenarios but at times also entirely new design and proof techniques. ...
The Snowden revelations of 2013 have shed some light on the extent of state-performed mass surveillance programs that target people all over the world, violate their privacy, and endanger their cyber security ...
The above HMAC construction is a secure PRF, since its inner hash chain is a PRF even against backdooring adversaries. ...
doi:10.25534/tuprints-00014550
fatcat:ybdjvz3u4fenlcpqrs7rugulcu