Multi-Instance Secure Public-Key Encryption. | 0 | 0.34 | 2022 |
XTR and Tori. | 0 | 0.34 | 2021 |
Untagging Tor: A Formal Treatment of Onion Encryption. | 0 | 0.34 | 2018 |
Assessing the Feasibility of Single Trace Power Analysis of Frodo. | 0 | 0.34 | 2018 |
Fly, you fool! Faster Frodo for the ARM Cortex-M4. | 0 | 0.34 | 2018 |
Authenticated Encryption in the Face of Protocol and Side Channel Leakage. | 2 | 0.38 | 2017 |
Turning Online Ciphers Off. | 1 | 0.35 | 2017 |
Multi-Key Authenticated Encryption with Corruptions: Reductions are Lossy. | 1 | 0.35 | 2017 |
Modes Of Operation Suitable For Computing On Encrypted Data | 4 | 0.41 | 2017 |
The Security of Tandem-DM in the Ideal Cipher Model. | 1 | 0.37 | 2017 |
How low can you go? Using side-channel data to enhance brute-force key recovery. | 0 | 0.34 | 2016 |
Indifferentiability of Confusion-Diffusion Networks. | 3 | 0.37 | 2016 |
A Modular Treatment of Cryptographic APIs: The Symmetric-Key Case. | 3 | 0.42 | 2016 |
Characterisation and Estimation of the Key Rank Distribution in the Context of Side Channel Evaluations. | 12 | 0.59 | 2016 |
Rogue Decryption Failures: Reconciling AE Robustness Notions. | 12 | 0.51 | 2015 |
How to Enumerate Your Keys Accurately and Efficiently After a Side Channel Attack. | 0 | 0.34 | 2015 |
Counting Keys in Parallel After a Side Channel Attack | 17 | 0.71 | 2015 |
Indifferentiability of Confusion-Diffusion Networks. | 0 | 0.34 | 2015 |
Simulatable Leakage: Analysis, Pitfalls, and New Constructions. | 8 | 0.42 | 2014 |
KDM Security in the Hybrid Framework. | 4 | 0.42 | 2014 |
Making and Breaking Leakage Simulators. | 0 | 0.34 | 2014 |
MJH: a faster alternative to MDC-2 | 17 | 0.60 | 2014 |
Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions. | 5 | 0.41 | 2013 |
On Symmetric Encryption with Distinguishable Decryption Failures. | 27 | 0.92 | 2013 |
A Leakage Resilient MAC. | 2 | 0.36 | 2013 |
Collisions are not incidental: a compression function exploiting discrete geometry | 8 | 0.54 | 2012 |
Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation. | 28 | 0.83 | 2012 |
Understanding adaptivity: random systems revisited | 129 | 3.13 | 2012 |
The preimage security of double-block-length compression functions | 162 | 3.95 | 2011 |
The symbiosis between collision and preimage resistance | 5 | 0.42 | 2011 |
Efficient hashing using the AES instruction set | 12 | 0.58 | 2011 |
The collision security of tandem-DM in the ideal cipher model | 28 | 1.05 | 2011 |
On the joint security of encryption and signature, revisited | 22 | 0.87 | 2011 |
Obfuscation for Cryptographic Purposes | 37 | 2.16 | 2010 |
Random Oracles with(out) Programmability | 18 | 0.62 | 2010 |
Collision Attacks against the Knudsen-Preneel Compression Functions | 2 | 0.35 | 2010 |
Attacking the Knudsen-Preneel compression functions | 3 | 0.36 | 2010 |
Another Glance at Double-Length Hashing | 27 | 0.94 | 2009 |
A New Randomness Extraction Paradigm for Hybrid Encryption | 391 | 12.50 | 2009 |
Blockcipher-Based Hashing Revisited | 41 | 1.37 | 2008 |
Building a Collision-Resistant Compression Function from Non-compressing Primitives | 44 | 2.48 | 2008 |
Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions | 414 | 13.89 | 2008 |
List signature schemes | 11 | 0.58 | 2006 |
Discrete logarithm variants of VSH | 5 | 0.51 | 2006 |
A key encapsulation mechanism for NTRU | 6 | 0.48 | 2005 |
Black-box secret sharing from primitive sets in algebraic number fields | 9 | 0.79 | 2005 |
Practical cryptography in high dimensional tori | 27 | 1.27 | 2005 |
Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic Three | 31 | 1.84 | 2005 |
On XTR and side-channel analysis | 4 | 0.46 | 2004 |
A Comparison of CEILIDH and XTR | 24 | 1.11 | 2004 |