John P. Steinberger

According to our database, John P. Steinberger authored at least 41 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

PPSZ for General k-SAT and CSP - Making Hertli's Analysis Simpler and 3-SAT Faster.

Dominik Scheder, John P. Steinberger

Comput. Complex., December, 2024

2018

Minimizing the Two-Round Even-Mansour Cipher.

Shan Chen, Rodolphe Lampe, Jooyoung Lee, Yannick Seurin, John P. Steinberger

J. Cryptol., 2018

Provable Security of (Tweakable) Block Ciphers Based on Substitution-Permutation Networks.

Benoît Cogliati, Yevgeniy Dodis, Jonathan Katz, Jooyoung Lee, John P. Steinberger, Aishwarya Thiruvengadam, Zhe Zhang

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017

The Security of Tandem-DM in the Ideal Cipher Model.

Jooyoung Lee, Martijn Stam, John P. Steinberger

J. Cryptol., 2017

Provable Security of Substitution-Permutation Networks.

Yevgeniy Dodis, Jonathan Katz, John P. Steinberger, Aishwarya Thiruvengadam, Zhe Zhang

IACR Cryptol. ePrint Arch., 2017

Five Rounds are Sufficient and Necessary for the Indifferentiability of Iterated Even-Mansour.

Yuanxi Dai, Yannick Seurin, John P. Steinberger, Aishwarya Thiruvengadam

IACR Cryptol. ePrint Arch., 2017

Random Oracles and Non-Uniformity.

Sandro Coretti, Yevgeniy Dodis, Siyao Guo, John P. Steinberger

IACR Cryptol. ePrint Arch., 2017

Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient.

Yuanxi Dai, Yannick Seurin, John P. Steinberger, Aishwarya Thiruvengadam

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster.

Dominik Scheder, John P. Steinberger

Proceedings of the 32nd Computational Complexity Conference, 2017

2016

Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN.

Yu Yu, John P. Steinberger

IACR Cryptol. ePrint Arch., 2016

Indifferentiability of 8-Round Feistel Networks.

Yuanxi Dai, John P. Steinberger

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015

Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes.

Peter Gazi, Jooyoung Lee, Yannick Seurin, John P. Steinberger, Stefano Tessaro

IACR Cryptol. ePrint Arch., 2015

Indifferentiability of Confusion-Diffusion Networks.

Yevgeniy Dodis, Tianren Liu, Martijn Stam, John P. Steinberger

IACR Cryptol. ePrint Arch., 2015

Feistel Networks: Indifferentiability at 8 Rounds.

Yuanxi Dai, John P. Steinberger

IACR Cryptol. ePrint Arch., 2015

Feistel Networks: Indifferentiability at 10 Rounds.

Yuanxi Dai, John P. Steinberger

IACR Cryptol. ePrint Arch., 2015

2014

Tight security bounds for multiple encryption.

Yuanxi Dai, John P. Steinberger

IACR Cryptol. ePrint Arch., 2014

The Security of Multiple Encryption in the Ideal Cipher Model.

Yuanxi Dai, Jooyoung Lee, Bart Mennink, John P. Steinberger

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013

To Hash or Not to Hash Again? (In)differentiability Results for H² and HMAC.

Yevgeniy Dodis, Thomas Ristenpart, John P. Steinberger, Stefano Tessaro

IACR Cryptol. ePrint Arch., 2013

Tight security bounds for key-alternating ciphers.

Shan Chen, John P. Steinberger

IACR Cryptol. ePrint Arch., 2013

On the Indifferentiability of Key-Alternating Ciphers.

Elena Andreeva, Andrey Bogdanov, Yevgeniy Dodis, Bart Mennink, John P. Steinberger

IACR Cryptol. ePrint Arch., 2013

Counting solutions to additive equations in random sets.

John P. Steinberger

CoRR, 2013

The Distinguishability of Product Distributions by Read-Once Branching Programs.

John P. Steinberger

Proceedings of the 28th Conference on Computational Complexity, 2013

2012

Multiproperty-Preserving Domain Extension Using Polynomial-Based Modes of Operation.

Jooyoung Lee, John P. Steinberger

IEEE Trans. Inf. Theory, 2012

Stam's Conjecture and Threshold Phenomena in Collision Resistance.

John P. Steinberger, Xiaoming Sun, Zhe Yang

IACR Cryptol. ePrint Arch., 2012

Improved Security Bounds for Key-Alternating Ciphers via Hellinger Distance.

John P. Steinberger

IACR Cryptol. ePrint Arch., 2012

Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations.

Andrey Bogdanov, Lars R. Knudsen, Gregor Leander, François-Xavier Standaert, John P. Steinberger, Elmar Tischhauser

IACR Cryptol. ePrint Arch., 2012

The Lowest-Degree Polynomial with Nonnegative Coefficients Divisible by the n-th Cyclotomic Polynomial.

John P. Steinberger

Electron. J. Comb., 2012

Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations - (Extended Abstract).

Andrey Bogdanov, Lars R. Knudsen, Gregor Leander, François-Xavier Standaert, John P. Steinberger, Elmar Tischhauser

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

To Hash or Not to Hash Again? (In)Differentiability Results for H 2 and HMAC.

Yevgeniy Dodis, Thomas Ristenpart, John P. Steinberger, Stefano Tessaro

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

2011

The preimage security of double-block-length compression functions.

Jooyoung Lee, Martijn Stam, John P. Steinberger

IACR Cryptol. ePrint Arch., 2011

Domain Extension for MACs Beyond the Birthday Barrier.

Yevgeniy Dodis, John P. Steinberger

Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

The Preimage Security of Double-Block-Length Compression Functions.

Frederik Armknecht, Ewan Fleischmann, Matthias Krause, Jooyoung Lee, Martijn Stam, John P. Steinberger

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010

The collision security of Tandem-DM in the ideal cipher model.

Jooyoung Lee, Martijn Stam, John P. Steinberger

IACR Cryptol. ePrint Arch., 2010

Multi-property-preserving Domain Extension Using Polynomial-based Modes of Operation.

Jooyoung Lee, John P. Steinberger

IACR Cryptol. ePrint Arch., 2010

Stam's Collision Resistance Conjecture.

John P. Steinberger

Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

2009

Tilings of the integers can have superpolynomial periods.

John P. Steinberger

Comb., 2009

Message Authentication Codes from Unpredictable Block Ciphers.

Yevgeniy Dodis, John P. Steinberger

Proceedings of the Advances in Cryptology, 2009

2008

Security/Efficiency Tradeoffs for Permutation-Based Hashing.

Phillip Rogaway, John P. Steinberger

Proceedings of the Advances in Cryptology, 2008

Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers.

Phillip Rogaway, John P. Steinberger

Proceedings of the Advances in Cryptology, 2008

2006

The Collision Intractability of MDC-2 in the Ideal Cipher Model.

John P. Steinberger

IACR Cryptol. ePrint Arch., 2006

2005

Indecomposable Tilings of the Integers with Exponentially Long Periods.

John P. Steinberger

Electron. J. Comb., 2005