Boaz Tsaban

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:47/2680 · DBLP profile ↗

← Back

19ranked-venue papers

8as first author

0since 2021 · last 2020

0000-0002-8677-6509ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 12 · 6 first-authorSecurity and privacy · 7 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security 6 papers		Cryptographic primitives and cryptanalysis · 100%
Theoretical computer science 2 papers		Algorithms and data structures · 87% Information theory · 13%

Topics — the 5 heaviest of 7, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Cryptographic primitives and cryptanalysis public-key cryptography	0.2	1	2015	Polynomial-Time Solutions of Computational Problems in Noncommutative-Algebraic Cryptography · J. Cryptol. 2015
Cryptographic primitives and cryptanalysis › block cipher substitution-permutation network	0.2	1	2015	Cryptanalysis of SP Networks with Partial Non-Linear Layers · EUROCRYPT (1) 2015
Algorithms and data structures polynomial-time algorithms	0.2	1	2015	Polynomial-Time Solutions of Computational Problems in Noncommutative-Algebraic Cryptography · J. Cryptol. 2015
Cryptographic primitives and cryptanalysis stream cipher	0.1	1	2007	Theoretical Cryptanalysis of the Klimov-Shamir Number Generator TF-1 · J. Cryptol. 2007
Cryptographic primitives and cryptanalysis random number generation	0.0	1	2001	Guaranteeing the Diversity of Number Generators · Inf. Comput. 2001

Methods — techniques the papers use, named apart from their topics

algebraic algorithms · 0.4algebraic cryptanalysis · 0.1

Year	Publication	Venue	Position
2020	A classification of the cofinal structures of precompacta Aviv Eshed, María Vicenta Ferrer, Salvador Hernández, Piotr Szewczak, Boaz Tsaban	Ann. Pure Appl. Log.	5
2018	Cryptanalysis via Algebraic Spans Adi Ben-Zvi, Arkadius G. Kalka, Boaz Tsaban	CRYPTO (1)	3
2017	Products of Menger spaces: A combinatorial approach Piotr Szewczak, Boaz Tsaban	Ann. Pure Appl. Log.	2
2016	A Practical Cryptanalysis of the Algebraic Eraser Adi Ben-Zvi, Simon R. Blackburn, Boaz Tsaban	CRYPTO (1)	3
2016	A reduction of Semigroup DLP to classic DLP Matan Banin, Boaz Tsaban	Des. Codes Cryptogr.	2
2016	SL2 homomorphic hash functions: worst case to average case reduction and short collision search Ciaran Mullan, Boaz Tsaban	Des. Codes Cryptogr.	2
2015	Cryptanalysis of SP Networks with Partial Non-Linear Layers Achiya Bar-On, Itai Dinur, Orr Dunkelman, Virginie Lallemand, Nathan Keller, Boaz Tsaban	EUROCRYPT (1)	6
2015	Polynomial-Time Solutions of Computational Problems in Noncommutative-Algebraic Cryptography Boaz Tsaban	J. Cryptol.	1
2014	Selective covering properties of product spaces Arnold W. Miller, Boaz Tsaban, Lyubomyr Zdomskyy	Ann. Pure Appl. Log.	2
2008	Combinatorial images of sets of reals and semifilter trichotomy abstract Abstract Using a dictionary translating a variety of classical and modern covering properties into combinatorial properties of continuous images, we get a simple way to understand the interrelations between these properties in ZFC and in the realm of the trichotomy axiom for upward closed families of sets of natural numbers. While it is now known that the answer to the Hurewicz 1927 problem is positive, it is shown here that semifilter trichotomy implies a negative answer to a slightly stronger form of this problem. Boaz Tsaban, Lyubomyr Zdomskyy	J. Symb. Log.	1
2007	Decompositions of graphs of functions and fast iterations of lookup tables Boaz Tsaban	Discret. Appl. Math.	1
2007	Theoretical Cryptanalysis of the Klimov-Shamir Number Generator TF-1 Boaz Tsaban	J. Cryptol.	1
2006	Covering the Baire space by families which are not finitely dominating Heike Mildenberger, Saharon Shelah, Boaz Tsaban	Ann. Pure Appl. Log.	3
2006	Fast generators for the Diffie-Hellman key agreement protocol and malicious standards Boaz Tsaban	Inf. Process. Lett.	1
2006	Menger's covering property and groupwise density abstract Abstract We establish a surprising connection between Menger's classical covering property and Blass-Laflamme's modern combinatorial notion of groupwise density. This connection implies a short proof of the groupwise density bound on the additivity number for Menger's property. Boaz Tsaban, Lyubomyr Zdomskyy	J. Symb. Log.	1
2004	The combinatorics of splittability Boaz Tsaban	Ann. Pure Appl. Log.	1
2003	Bernoulli Numbers and the Probability of a Birthday Surprise Boaz Tsaban	Discret. Appl. Math.	1
2003	Additivity properties of topological diagonalizations abstract Abstract We answer a question of Just, Miller, Scheepers and Szeptycki whether certain diagonalization properties for sequences of open covers are provably closed under taking finite or countable unions. Tomek Bartoszynski, Saharon Shelah, Boaz Tsaban	J. Symb. Log.	3
2001	Guaranteeing the Diversity of Number Generators Adi Shamir, Boaz Tsaban	Inf. Comput.	2