default search action
John P. Steinberger
Person information
- affiliation: Tsinghua University, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Dominik Scheder, John P. Steinberger:
PPSZ for General k-SAT and CSP - Making Hertli's Analysis Simpler and 3-SAT Faster. Comput. Complex. 33(2): 13 (2024)
2010 – 2019
- 2018
- [j6]Shan Chen, Rodolphe Lampe, Jooyoung Lee, Yannick Seurin, John P. Steinberger:
Minimizing the Two-Round Even-Mansour Cipher. J. Cryptol. 31(4): 1064-1119 (2018) - [c25]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: 722-753 - [c24]Sandro Coretti, Yevgeniy Dodis, Siyao Guo, John P. Steinberger:
Random Oracles and Non-uniformity. EUROCRYPT (1) 2018: 227-258 - 2017
- [j5]Jooyoung Lee, Martijn Stam, John P. Steinberger:
The Security of Tandem-DM in the Ideal Cipher Model. J. Cryptol. 30(2): 495-518 (2017) - [c23]Dominik Scheder
, John P. Steinberger:
PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster. CCC 2017: 9:1-9:15 - [c22]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: 524-555 - [i21]Yevgeniy Dodis, Jonathan Katz, John P. Steinberger, Aishwarya Thiruvengadam, Zhe Zhang:
Provable Security of Substitution-Permutation Networks. IACR Cryptol. ePrint Arch. 2017: 16 (2017) - [i20]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: 42 (2017) - [i19]Sandro Coretti, Yevgeniy Dodis, Siyao Guo, John P. Steinberger:
Random Oracles and Non-Uniformity. IACR Cryptol. ePrint Arch. 2017: 937 (2017) - 2016
- [c21]Yuanxi Dai, John P. Steinberger:
Indifferentiability of 8-Round Feistel Networks. CRYPTO (1) 2016: 95-120 - [c20]Yu Yu, John P. Steinberger:
Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN. EUROCRYPT (2) 2016: 154-183 - [c19]Yevgeniy Dodis, Martijn Stam, John P. Steinberger, Tianren Liu
Indifferentiability of Confusion-Diffusion Networks. EUROCRYPT (2) 2016: 679-704 - [i18]Yu Yu, John P. Steinberger:
Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN. IACR Cryptol. ePrint Arch. 2016: 151 (2016) - 2015
- [c18]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: 319-341 - [i17]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: 397 (2015) - [i16]Yevgeniy Dodis, Tianren Liu, Martijn Stam, John P. Steinberger:
Indifferentiability of Confusion-Diffusion Networks. IACR Cryptol. ePrint Arch. 2015: 680 (2015) - [i15]Yuanxi Dai, John P. Steinberger:
Feistel Networks: Indifferentiability at 10 Rounds. IACR Cryptol. ePrint Arch. 2015: 874 (2015) - [i14]Yuanxi Dai, John P. Steinberger:
Feistel Networks: Indifferentiability at 8 Rounds. IACR Cryptol. ePrint Arch. 2015: 1069 (2015) - 2014
- [c17]Yuanxi Dai, Jooyoung Lee, Bart Mennink, John P. Steinberger:
The Security of Multiple Encryption in the Ideal Cipher Model. CRYPTO (1) 2014: 20-38 - [c16]Shan Chen, Rodolphe Lampe, Jooyoung Lee, Yannick Seurin, John P. Steinberger:
Minimizing the Two-Round Even-Mansour Cipher. CRYPTO (1) 2014: 39-56 - [c15]Shan Chen, John P. Steinberger:
Tight Security Bounds for Key-Alternating Ciphers. EUROCRYPT 2014: 327-350 - [i13]Yuanxi Dai, John P. Steinberger:
Tight security bounds for multiple encryption. IACR Cryptol. ePrint Arch. 2014: 96 (2014) - [i12]Shan Chen, Rodolphe Lampe, Jooyoung Lee, Yannick Seurin, John P. Steinberger:
Minimizing the Two-Round Even-Mansour Cipher. IACR Cryptol. ePrint Arch. 2014: 443 (2014) - 2013
- [c14]John P. Steinberger:
The Distinguishability of Product Distributions by Read-Once Branching Programs. CCC 2013: 248-254 - [c13]Elena Andreeva
On the Indifferentiability of Key-Alternating Ciphers. CRYPTO (1) 2013: 531-550 - [i11]John P. Steinberger:
Counting solutions to additive equations in random sets. CoRR abs/1309.5582 (2013) - [i10]Elena Andreeva, Andrey Bogdanov, Yevgeniy Dodis, Bart Mennink, John P. Steinberger:
On the Indifferentiability of Key-Alternating Ciphers. IACR Cryptol. ePrint Arch. 2013: 61 (2013) - [i9]Shan Chen, John P. Steinberger:
Tight security bounds for key-alternating ciphers. IACR Cryptol. ePrint Arch. 2013: 222 (2013) - [i8]Yevgeniy Dodis, Thomas Ristenpart, John P. Steinberger, Stefano Tessaro:
To Hash or Not to Hash Again? (In)differentiability Results for H2 and HMAC. IACR Cryptol. ePrint Arch. 2013: 382 (2013) - 2012
- [j4]John P. Steinberger:
The Lowest-Degree Polynomial with Nonnegative Coefficients Divisible by the n-th Cyclotomic Polynomial. Electron. J. Comb. 19(4): 1 (2012) - [j3]Jooyoung Lee, John P. Steinberger:
Multiproperty-Preserving Domain Extension Using Polynomial-Based Modes of Operation. IEEE Trans. Inf. Theory 58(9): 6165-6182 (2012) - [c12]Yevgeniy Dodis, Thomas Ristenpart
To Hash or Not to Hash Again? (In)Differentiability Results for H 2 and HMAC. CRYPTO 2012: 348-366 - [c11]John P. Steinberger, Xiaoming Sun
Stam's Conjecture and Threshold Phenomena in Collision Resistance. CRYPTO 2012: 384-405 - [c10]Andrey Bogdanov, Lars R. Knudsen, Gregor Leander
Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations - (Extended Abstract). EUROCRYPT 2012: 45-62 - [i7]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: 35 (2012) - [i6]John P. Steinberger, Xiaoming Sun, Zhe Yang:
Stam's Conjecture and Threshold Phenomena in Collision Resistance. IACR Cryptol. ePrint Arch. 2012: 451 (2012) - [i5]John P. Steinberger:
Improved Security Bounds for Key-Alternating Ciphers via Hellinger Distance. IACR Cryptol. ePrint Arch. 2012: 481 (2012) - 2011
- [c9]Frederik Armknecht
The Preimage Security of Double-Block-Length Compression Functions. ASIACRYPT 2011: 233-251 - [c8]Jooyoung Lee, Martijn Stam, John P. Steinberger:
The Collision Security of Tandem-DM in the Ideal Cipher Model. CRYPTO 2011: 561-577 - [c7]Yevgeniy Dodis, John P. Steinberger:
Domain Extension for MACs Beyond the Birthday Barrier. EUROCRYPT 2011: 323-342 - [i4]Jooyoung Lee, Martijn Stam, John P. Steinberger:
The preimage security of double-block-length compression functions. IACR Cryptol. ePrint Arch. 2011: 210 (2011) - 2010
- [c6]Jooyoung Lee, John P. Steinberger:
Multi-property-preserving Domain Extension Using Polynomial-Based Modes of Operation. EUROCRYPT 2010: 573-596 - [c5]John P. Steinberger:
Stam's Collision Resistance Conjecture. EUROCRYPT 2010: 597-615 - [i3]Jooyoung Lee, John P. Steinberger:
Multi-property-preserving Domain Extension Using Polynomial-based Modes of Operation. IACR Cryptol. ePrint Arch. 2010: 131 (2010) - [i2]Jooyoung Lee, Martijn Stam, John P. Steinberger:
The collision security of Tandem-DM in the ideal cipher model. IACR Cryptol. ePrint Arch. 2010: 409 (2010)
2000 – 2009
- 2009
- [j2]John P. Steinberger:
Tilings of the integers can have superpolynomial periods. Comb. 29(4): 503-509 (2009) - [c4]Yevgeniy Dodis, John P. Steinberger:
Message Authentication Codes from Unpredictable Block Ciphers. CRYPTO 2009: 267-285 - 2008
- [c3]Phillip Rogaway, John P. Steinberger:
Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers. CRYPTO 2008: 433-450 - [c2]Phillip Rogaway, John P. Steinberger:
Security/Efficiency Tradeoffs for Permutation-Based Hashing. EUROCRYPT 2008: 220-236 - 2007
- [c1]John P. Steinberger:
The Collision Intractability of MDC-2 in the Ideal-Cipher Model. EUROCRYPT 2007: 34-51 - 2006
- [i1]John P. Steinberger:
The Collision Intractability of MDC-2 in the Ideal Cipher Model. IACR Cryptol. ePrint Arch. 2006: 294 (2006) - 2005
- [j1]John P. Steinberger:
Indecomposable Tilings of the Integers with Exponentially Long Periods. Electron. J. Comb. 12 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: