An efficient quantum collision search algorithm and implications on symmetric cryptography
A Chailloux, M Naya-Plasencia… - Advances in Cryptology …, 2017 - Springer
The cryptographic community has widely acknowledged that the emergence of large
quantum computers will pose a threat to most current public-key cryptography. Primitives …
quantum computers will pose a threat to most current public-key cryptography. Primitives …
The random oracle model: a twenty-year retrospective
N Koblitz, AJ Menezes - Designs, Codes and Cryptography, 2015 - Springer
It has been roughly two decades since the random oracle model for reductionist security
arguments was introduced and one decade since we first discussed the controversy that had …
arguments was introduced and one decade since we first discussed the controversy that had …
An efficient lattice-based signature scheme with provably secure instantiation
In view of the expected progress in cryptanalysis it is important to find alternatives for
currently used signature schemes such as RSA and ECDSA. The most promising lattice …
currently used signature schemes such as RSA and ECDSA. The most promising lattice …
A note on quantum security for post-quantum cryptography
F Song - International Workshop on Post-Quantum …, 2014 - Springer
Shor's quantum factoring algorithm and a few other efficient quantum algorithms break many
classical crypto-systems. In response, people proposed post-quantum cryptography based …
classical crypto-systems. In response, people proposed post-quantum cryptography based …
Multi-key security: The Even-Mansour construction revisited
Abstract At ASIACRYPT 1991, Even and Mansour introduced a block cipher construction
based on a single permutation. Their construction has since been lauded for its simplicity …
based on a single permutation. Their construction has since been lauded for its simplicity …
Full-state keyed duplex with built-in multi-user support
The keyed duplex construction was introduced by Bertoni et al.(SAC 2011) and recently
generalized to full-state absorption by Mennink et al.(ASIACRYPT 2015). We present a …
generalized to full-state absorption by Mennink et al.(ASIACRYPT 2015). We present a …
Boosting authenticated encryption robustness with minimal modifications
Secure and highly efficient authenticated encryption (AE) algorithms which achieve data
confidentiality and authenticity in the symmetric-key setting have existed for well over a …
confidentiality and authenticity in the symmetric-key setting have existed for well over a …
Optimal security proofs for full domain hash, revisited
Abstract RSA Full Domain Hash (RSA-FDH) is a digital signature scheme, secure again
chosen message attacks in the random oracle model. The best known security reduction …
chosen message attacks in the random oracle model. The best known security reduction …
Critical perspectives on provable security: Fifteen years of" another look" papers
Contents Page 1 CRITICAL PERSPECTIVES ON PROVABLE SECURITY: FIFTEEN YEARS OF
“ANOTHER LOOK” PAPERS NEAL KOBLITZ AND ALFRED MENEZES Abstract. We give an …
“ANOTHER LOOK” PAPERS NEAL KOBLITZ AND ALFRED MENEZES Abstract. We give an …
Analyzing multi-key security degradation
The multi-key, or multi-user, setting challenges cryptographic algorithms to maintain high
levels of security when used with many different keys, by many different users. Its …
levels of security when used with many different keys, by many different users. Its …