| Publication | Date of Publication | Type |
|---|
| Making the identity-based Diffie-Hellman key exchange efficiently revocable | 2024-10-16 | Paper |
The COLM Authenticated Encryption Scheme
Journal of Cryptology | 2024-04-21 | Paper |
A modular approach to the incompressibility of block-cipher-based AEADs
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-16 | Paper |
Optimizing Online Permutation-Based AE Schemes for Lightweight Applications
Information Security Practice and Experience | 2022-12-09 | Paper |
| Rate-one AE with security under RUP | 2022-11-02 | Paper |
\(\mathsf{DWCDM}_+\): a BBB secure nonce based MAC
Advances in Mathematics of Communications | 2019-09-19 | Paper |
Beyond conventional security in sponge-based authenticated encryption modes
Journal of Cryptology | 2019-08-13 | Paper |
| Building quantum-one-way functions from block ciphers: Davies-Meyer and Merkle-Damgård constructions | 2018-12-20 | Paper |
| Encrypt or decrypt -- to make a single-key beyond birthday secure nonce-based MAC | 2018-09-12 | Paper |
New bounds for keyed sponges with extendable output: independence between capacity and message length
Fast Software Encryption | 2018-05-09 | Paper |
A MAC mode for lightweight block ciphers
Fast Software Encryption | 2018-05-09 | Paper |
On the influence of message length in PMAC's security bounds
Advances in Cryptology – EUROCRYPT 2016 | 2016-09-09 | Paper |
A New Mode of Operation for Incremental Authenticated Encryption with Associated Data
Lecture Notes in Computer Science | 2016-05-19 | Paper |
How to incorporate associated data in sponge-based authenticated encryption
Lecture Notes in Computer Science | 2016-03-02 | Paper |
Generalizing PMAC under weaker assumptions
Information Security and Privacy | 2015-10-20 | Paper |
COBRA: a parallelizable authenticated online cipher without block cipher inverse
Fast Software Encryption | 2015-09-18 | Paper |
APE: authenticated permutation-based encryption for lightweight cryptography
Fast Software Encryption | 2015-09-18 | Paper |
How to securely release unverified plaintext in authenticated encryption
Lecture Notes in Computer Science | 2015-01-16 | Paper |
Generic state-recovery and forgery attacks on chopmd-MAC and on NMAC/HMAC
Advances in Information and Computer Security | 2014-09-15 | Paper |
Parallelizable and authenticated online ciphers
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
The security of the OCB mode of operation without the SPRP assumption
Provable Security | 2013-10-23 | Paper |
The Security and Performance of “GCM” when Short Multiplications Are Used Instead
Information Security and Cryptology | 2013-05-28 | Paper |
PMAC with parity: minimizing the query-length influence
Lecture Notes in Computer Science | 2012-06-08 | Paper |
A new variant of PMAC: beyond the birthday bound
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Known-key distinguishers on 11-round Feistel and collision attacks on its hashing modes
Fast Software Encryption | 2011-07-07 | Paper |
The sum of CBC MACs is a secure PRF
Topics in Cryptology - CT-RSA 2010 | 2010-03-16 | Paper |
BTM: a single-key, inverse-cipher-free mode for deterministic authenticated encryption
Selected Areas in Cryptography | 2009-12-09 | Paper |
HBS: A Single-Key Mode of Operation for Deterministic Authenticated Encryption
Fast Software Encryption | 2009-08-11 | Paper |
A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier
Advances in Cryptology - EUROCRYPT 2009 | 2009-05-12 | Paper |
“Sandwich” Is Indeed Secure: How to Authenticate a Message with Just One Hashing
Information Security and Privacy | 2009-03-06 | Paper |
How to Fill Up Merkle-Damgård Hash Functions
Advances in Cryptology - ASIACRYPT 2008 | 2009-02-10 | Paper |
A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
Fast Software Encryption | 2008-09-18 | Paper |
Boosting Merkle-Damgård Hashing for Message Authentication
Advances in Cryptology – ASIACRYPT 2007 | 2008-05-15 | Paper |
Multilane HMAC— Security beyond the Birthday Limit
Lecture Notes in Computer Science | 2008-04-11 | Paper |
Magic "Squares" Indeed!
American Mathematical Monthly | 2001-11-26 | Paper |
