Johan Sjödin

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.

EDBT 2026 Demo / reviewers in the wild / expert

dblp:84/975 · DBLP profile ↗

← Back

7ranked-venue papers

0as first author

0since 2021 · last 2008

—ORCID · none

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

Security and privacy · 5Theory of computation · 2

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%

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

Topic	Weight	Papers	Last	Evidence papers
Cryptographic primitives and cryptanalysis pseudorandom functions	0.2	2	2008	Weak Pseudorandom Functions in Minicrypt · ICALP (2) 2008 Range Extension for Weak PRFs; The Good, the Bad, and the Ugly · EUROCRYPT 2007
Cryptographic primitives and cryptanalysis › pseudorandom functions weak pseudorandom functions	0.1	1	2008	Weak Pseudorandom Functions in Minicrypt · ICALP (2) 2008
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption chosen-ciphertext security	0.1	1	2007	A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security · EUROCRYPT 2007
Cryptographic primitives and cryptanalysis › public-key cryptography public-key encryption	0.1	1	2007	A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security · EUROCRYPT 2007
Cryptographic primitives and cryptanalysis › pseudorandom functions luby-rackoff construction	0.1	1	2006	Luby-Rackoff Ciphers from Weak Round Functions? · EUROCRYPT 2006
Cryptographic primitives and cryptanalysis › pseudorandomness pseudorandom permutations	0.1	1	2006	Luby-Rackoff Ciphers from Weak Round Functions? · EUROCRYPT 2006
Cryptographic primitives and cryptanalysis symmetric cryptography	0.1	1	2006	Luby-Rackoff Ciphers from Weak Round Functions? · EUROCRYPT 2006
Cryptographic primitives and cryptanalysis message authentication codes	0.1	1	2005	Single-Key AIL-MACs from Any FIL-MAC · ICALP 2005
Cryptographic primitives and cryptanalysis cryptographic assumptions	0.0	1	2004	Complete Classification of Bilinear Hard-Core Functions · CRYPTO 2004
Cryptographic primitives and cryptanalysis › one-way functions hard-core predicates	0.0	1	2004	Complete Classification of Bilinear Hard-Core Functions · CRYPTO 2004
Cryptographic primitives and cryptanalysis › cryptographic foundations › complexity-based cryptography minicrypt	0.0	1	2008	Weak Pseudorandom Functions in Minicrypt · ICALP (2) 2008

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

provable security · 0.1cryptographic reduction · 0.1complexity theory · 0.0

Year	Publication	Venue	Position
2008	Weak Pseudorandom Functions in Minicrypt Krzysztof Pietrzak, Johan Sjödin	ICALP (2)	2
2007	A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security Ueli Maurer, Johan Sjödin	EUROCRYPT	2
2007	Range Extension for Weak PRFs; The Good, the Bad, and the Ugly Krzysztof Pietrzak, Johan Sjödin	EUROCRYPT	2
2006	Luby-Rackoff Ciphers from Weak Round Functions? Ueli Maurer, Yvonne-Anne Pignolet, Krzysztof Pietrzak, Johan Sjödin	EUROCRYPT	4
2005	Single-Key AIL-MACs from Any FIL-MAC Ueli Maurer, Johan Sjödin	ICALP	2
2005	Domain Expansion of MACs: Alternative Uses of the FIL-MAC Ueli Maurer, Johan Sjödin	IMACC	2
2004	Complete Classification of Bilinear Hard-Core Functions Thomas Holenstein, Ueli Maurer, Johan Sjödin	CRYPTO	3