John P. Steinberger

Publication Activity (10 Years)

Years Active: 2005-2018
Publications (10 Years): 18

Top Topics

Generalization Error Bounds

Security Measures

Top Venues

IACR Cryptol. ePrint Arch.

Publications

Shan Chen, Rodolphe Lampe, Jooyoung Lee, Yannick Seurin, John P. Steinberger
Minimizing the Two-Round Even-Mansour Cipher. J. Cryptol. 31 (4) (2018)
Benoît Cogliati, Yevgeniy Dodis, Jonathan Katz, Jooyoung Lee, John P. Steinberger, Aishwarya Thiruvengadam, Zhe Zhang
Provable Security of (Tweakable) Block Ciphers Based on Substitution-Permutation Networks. CRYPTO (1) (2018)
Sandro Coretti, Yevgeniy Dodis, Siyao Guo, John P. Steinberger
Random Oracles and Non-uniformity. EUROCRYPT (1) (2018)
Dominik Scheder, John P. Steinberger
PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster. Computational Complexity Conference (2017)
Yevgeniy Dodis, Jonathan Katz, John P. Steinberger, Aishwarya Thiruvengadam, Zhe Zhang
Provable Security of Substitution-Permutation Networks. IACR Cryptol. ePrint Arch. 2017 (2017)
Jooyoung Lee, Martijn Stam, John P. Steinberger
The Security of Tandem-DM in the Ideal Cipher Model. J. Cryptol. 30 (2) (2017)
Sandro Coretti, Yevgeniy Dodis, Siyao Guo, John P. Steinberger
Random Oracles and Non-Uniformity. IACR Cryptol. ePrint Arch. 2017 (2017)
Yuanxi Dai, Yannick Seurin, John P. Steinberger, Aishwarya Thiruvengadam
Five Rounds are Sufficient and Necessary for the Indifferentiability of Iterated Even-Mansour. IACR Cryptol. ePrint Arch. 2017 (2017)
Yuanxi Dai, Yannick Seurin, John P. Steinberger, Aishwarya Thiruvengadam
Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient. CRYPTO (3) (2017)
Yuanxi Dai, John P. Steinberger
Indifferentiability of 8-Round Feistel Networks. CRYPTO (1) (2016)
Yu Yu, John P. Steinberger
Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN. EUROCRYPT (2) (2016)
Yevgeniy Dodis, Martijn Stam, John P. Steinberger, Tianren Liu
Indifferentiability of Confusion-Diffusion Networks. EUROCRYPT (2) (2016)
Yu Yu, John P. Steinberger
Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN. IACR Cryptol. ePrint Arch. 2016 (2016)
Peter Gazi, Jooyoung Lee, Yannick Seurin, John P. Steinberger, Stefano Tessaro
Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes. IACR Cryptol. ePrint Arch. 2015 (2015)
Yevgeniy Dodis, Tianren Liu, Martijn Stam, John P. Steinberger
Indifferentiability of Confusion-Diffusion Networks. IACR Cryptol. ePrint Arch. 2015 (2015)
Peter Gazi, Jooyoung Lee, Yannick Seurin, John P. Steinberger, Stefano Tessaro
Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes. FSE (2015)
Yuanxi Dai, John P. Steinberger
Feistel Networks: Indifferentiability at 10 Rounds. IACR Cryptol. ePrint Arch. 2015 (2015)
Yuanxi Dai, John P. Steinberger
Feistel Networks: Indifferentiability at 8 Rounds. IACR Cryptol. ePrint Arch. 2015 (2015)
Yuanxi Dai, John P. Steinberger
Tight security bounds for multiple encryption. IACR Cryptol. ePrint Arch. 2014 (2014)
Yuanxi Dai, Jooyoung Lee, Bart Mennink, John P. Steinberger
The Security of Multiple Encryption in the Ideal Cipher Model. CRYPTO (1) (2014)
Shan Chen, Rodolphe Lampe, Jooyoung Lee, Yannick Seurin, John P. Steinberger
Minimizing the Two-Round Even-Mansour Cipher. CRYPTO (1) (2014)
Shan Chen, Rodolphe Lampe, Jooyoung Lee, Yannick Seurin, John P. Steinberger
Minimizing the Two-Round Even-Mansour Cipher. IACR Cryptol. ePrint Arch. 2014 (2014)
Shan Chen, John P. Steinberger
Tight Security Bounds for Key-Alternating Ciphers. EUROCRYPT (2014)
Shan Chen, John P. Steinberger
Tight security bounds for key-alternating ciphers. IACR Cryptol. ePrint Arch. 2013 (2013)
John P. Steinberger
Counting solutions to additive equations in random sets. CoRR (2013)
Elena Andreeva, Andrey Bogdanov, Yevgeniy Dodis, Bart Mennink, John P. Steinberger
On the Indifferentiability of Key-Alternating Ciphers. CRYPTO (1) (2013)
John P. Steinberger
The Distinguishability of Product Distributions by Read-Once Branching Programs. Computational Complexity Conference (2013)
Elena Andreeva, Andrey Bogdanov, Yevgeniy Dodis, Bart Mennink, John P. Steinberger
On the Indifferentiability of Key-Alternating Ciphers. IACR Cryptol. ePrint Arch. 2013 (2013)
Yevgeniy Dodis, Thomas Ristenpart, John P. Steinberger, Stefano Tessaro
and HMAC. IACR Cryptol. ePrint Arch. 2013 (2013)
John P. Steinberger, Xiaoming Sun, Zhe Yang
Stam's Conjecture and Threshold Phenomena in Collision Resistance. IACR Cryptol. ePrint Arch. 2012 (2012)
Yevgeniy Dodis, Thomas Ristenpart, John P. Steinberger, Stefano Tessaro
To Hash or Not to Hash Again? (In)Differentiability Results for H 2 and HMAC. CRYPTO (2012)
John P. Steinberger
The Lowest-Degree Polynomial with Nonnegative Coefficients Divisible by the n-th Cyclotomic Polynomial. Electron. J. Comb. 19 (4) (2012)
Andrey Bogdanov, Lars R. Knudsen, Gregor Leander, François-Xavier Standaert, John P. Steinberger, Elmar Tischhauser
Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations - (Extended Abstract). EUROCRYPT (2012)
Andrey Bogdanov, Lars R. Knudsen, Gregor Leander, François-Xavier Standaert, John P. Steinberger, Elmar Tischhauser
Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations. IACR Cryptol. ePrint Arch. 2012 (2012)
Jooyoung Lee, John P. Steinberger
Multiproperty-Preserving Domain Extension Using Polynomial-Based Modes of Operation. IEEE Trans. Inf. Theory 58 (9) (2012)
John P. Steinberger, Xiaoming Sun, Zhe Yang
Stam's Conjecture and Threshold Phenomena in Collision Resistance. CRYPTO (2012)
John P. Steinberger
Improved Security Bounds for Key-Alternating Ciphers via Hellinger Distance. IACR Cryptol. ePrint Arch. 2012 (2012)
Jooyoung Lee, Martijn Stam, John P. Steinberger
The preimage security of double-block-length compression functions. IACR Cryptol. ePrint Arch. 2011 (2011)
Frederik Armknecht, Ewan Fleischmann, Matthias Krause, Jooyoung Lee, Martijn Stam, John P. Steinberger
The Preimage Security of Double-Block-Length Compression Functions. ASIACRYPT (2011)
Yevgeniy Dodis, John P. Steinberger
Domain Extension for MACs Beyond the Birthday Barrier. EUROCRYPT (2011)
Jooyoung Lee, Martijn Stam, John P. Steinberger
The Collision Security of Tandem-DM in the Ideal Cipher Model. CRYPTO (2011)
Jooyoung Lee, John P. Steinberger
Multi-property-preserving Domain Extension Using Polynomial-based Modes of Operation. IACR Cryptol. ePrint Arch. 2010 (2010)
Jooyoung Lee, John P. Steinberger
Multi-property-preserving Domain Extension Using Polynomial-Based Modes of Operation. EUROCRYPT (2010)
John P. Steinberger
Stam's Collision Resistance Conjecture. EUROCRYPT (2010)
Jooyoung Lee, Martijn Stam, John P. Steinberger
The collision security of Tandem-DM in the ideal cipher model. IACR Cryptol. ePrint Arch. 2010 (2010)
John P. Steinberger
Tilings of the integers can have superpolynomial periods. Comb. 29 (4) (2009)
Yevgeniy Dodis, John P. Steinberger
Message Authentication Codes from Unpredictable Block Ciphers. CRYPTO (2009)
Phillip Rogaway, John P. Steinberger
Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers. CRYPTO (2008)
Phillip Rogaway, John P. Steinberger
Security/Efficiency Tradeoffs for Permutation-Based Hashing. EUROCRYPT (2008)
John P. Steinberger
The Collision Intractability of MDC-2 in the Ideal-Cipher Model. EUROCRYPT (2007)
John P. Steinberger
The Collision Intractability of MDC-2 in the Ideal Cipher Model. IACR Cryptol. ePrint Arch. 2006 (2006)
John P. Steinberger
Indecomposable Tilings of the Integers with Exponentially Long Periods. Electron. J. Comb. 12 (2005)