J. Steinberger

发表

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

John P. Steinberger, Martijn Stam, Jooyoung Lee, 2011, CRYPTO.

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

John P. Steinberger, J. Steinberger, 2007, IACR Cryptol. ePrint Arch..

Message Authentication Codes from Unpredictable Block Ciphers

John P. Steinberger, Yevgeniy Dodis, Yevgeniy Dodis, 2009, CRYPTO.

Tilings of the Integers, Vanishing Sums of Roots of Unity, and Cyclotomic Arrays

J. Steinberger, 2007 .

Erratum to “A class of prototiles with doubly generated level semigroups” [Journal of Combinatorial Theory-Series A 106 (2004) 1–13]

J. Steinberger, 2004 .

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

John P. Steinberger, Yannick Seurin, Aishwarya Thiruvengadam, 2017, IACR Cryptol. ePrint Arch..

PPSZ for General kSAT – Making Hertli ’ s Analysis Simpler and 3SAT Faster ∗

J. Steinberger, Dominik Scheder, 2017 .

Advances in Cryptology – CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II

John P. Steinberger, Martijn Stam, Joojoung Lee, 2020, CRYPTO.

Tilings of the integers can have superpolynomial periods

John P. Steinberger, J. Steinberger, 2009, Comb..

Quasiperiodic Group Factorizations

J. Steinberger, 2008 .

Multiple tilings of Z with long periods, and tiles with many-generated level semigroups

J. Steinberger, 2005 .

Random Oracles and Non-Uniformity

John P. Steinberger, Yevgeniy Dodis, Sandro Coretti, 2018, IACR Cryptol. ePrint Arch..

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

Jonathan Katz, John P. Steinberger, Zhe Zhang, 2018, CRYPTO.

Provable Security of Substitution-Permutation Networks

Jonathan Katz, John P. Steinberger, Zhe Zhang, 2017, IACR Cryptol. ePrint Arch..

Security/Efficiency Tradeoffs for Permutation-Based Hashing

John P. Steinberger, Phillip Rogaway, P. Rogaway, 2008, EUROCRYPT.

Tight Security Bounds for Key-Alternating Ciphers

John P. Steinberger, Shan Chen, J. Steinberger, 2014, EUROCRYPT.

On the Indifferentiability of Key-Alternating Ciphers

John P. Steinberger, Andrey Bogdanov, Bart Mennink, 2013, IACR Cryptol. ePrint Arch..

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

John P. Steinberger, Andrey Bogdanov, Lars R. Knudsen, 2012, IACR Cryptol. ePrint Arch..

Improved Security Bounds for Key-Alternating Ciphers via Hellinger Distance

John P. Steinberger, J. Steinberger, 2012, IACR Cryptol. ePrint Arch..

Minimizing the Two-Round Even–Mansour Cipher

John P. Steinberger, Yannick Seurin, Shan Chen, 2014, Journal of Cryptology.

Minimizing the Two-Round Even–Mansour Cipher

Y. Seurin, Jooyoung Lee, J. Steinberger, 2018, Journal of Cryptology.

Counting solutions to additive equations in random sets pdf

John P. Steinberger, J. Steinberger, 2013, ArXiv.

Domain Extension for MACs Beyond the Birthday Barrier

John P. Steinberger, Yevgeniy Dodis, J. Steinberger, 2011, EUROCRYPT.

The Security of Multiple Encryption in the Ideal Cipher Model

John P. Steinberger, Bart Mennink, Jooyoung Lee, 2014, CRYPTO.

The preimage security of double-block-length compression functions

John P. Steinberger, Martijn Stam, Jooyoung Lee, 2011, IACR Cryptol. ePrint Arch..

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

John P. Steinberger, Yannick Seurin, Aishwarya Thiruvengadam, 2017, CRYPTO.

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

John P. Steinberger, Yannick Seurin, Stefano Tessaro, 2015, IACR Cryptol. ePrint Arch..

Tight security bounds for multiple encryption

John P. Steinberger, Yuanxi Dai, J. Steinberger, 2014, IACR Cryptol. ePrint Arch..

To Hash or Not to Hash Again? (In)differentiability Results for H2 and HMAC

John P. Steinberger, Yevgeniy Dodis, Stefano Tessaro, 2012, IACR Cryptol. ePrint Arch..

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

John P. Steinberger, J. Steinberger, 2012, Electron. J. Comb..

Minimal vanishing sums of roots of unity with large coefficients

John P. Steinberger, J. Steinberger, 2008 .

Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers

John P. Steinberger, Phillip Rogaway, P. Rogaway, 2008, CRYPTO.

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

John P. Steinberger, Dominik Scheder, J. Steinberger, 2017, CCC.

To Hash or Not to Hash Again? (In)differentiability Results for H2 and HMAC

Stefano Tessaro, J. Steinberger, Y. Dodis, 2012, IACR Cryptol. ePrint Arch..

Minimizing the Two-Round Even-Mansour Cipher

Y. Seurin, Jooyoung Lee, J. Steinberger, 2014, IACR Cryptol. ePrint Arch..

Minimizing the Two-Round Even–Mansour Cipher

John P. Steinberger, Yannick Seurin, Shan Chen, 2018, Journal of Cryptology.