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

Onur Özen

dblp:53/7079 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
0since 2021 · last 2012
—ORCID · none

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

Security and privacy · 9 · 4 first-authorTheory of computation · 1

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
4 papers
Cryptographic primitives and cryptanalysis · 95% Cryptographic protocols and secure computation · 5%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Processor architecture and microarchitecture · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
hash functions
0.222011
Efficient Hashing Using the AES Instruction Set · CHES 2011
Collision Attacks against the Knudsen-Preneel Compression Functions · ASIACRYPT 2010
Cryptographic primitives and cryptanalysis
provable security
0.112012
Understanding Adaptivity: Random Systems Revisited · ASIACRYPT 2012
Cryptographic primitives and cryptanalysis › hash functions
AES-like hashing
0.112011
Efficient Hashing Using the AES Instruction Set · CHES 2011
Cryptographic primitives and cryptanalysis › hash function cryptanalysis
collision attack
0.112010
Collision Attacks against the Knudsen-Preneel Compression Functions · ASIACRYPT 2010
Cryptographic primitives and cryptanalysis › hash functions › hash function constructions
compression functions
0.112010
Collision Attacks against the Knudsen-Preneel Compression Functions · ASIACRYPT 2010
Cryptographic primitives and cryptanalysis
hash function cryptanalysis
0.112009
Improved Cryptanalysis of Skein · ASIACRYPT 2009
Cryptographic protocols and secure computation › secure multiparty computation
adaptive security
0.012012
Understanding Adaptivity: Random Systems Revisited · ASIACRYPT 2012
Processor architecture and microarchitecture › instruction set architecture
instruction set extension
0.012011
Efficient Hashing Using the AES Instruction Set · CHES 2011

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

rotational cryptanalysis · 0.1rebound attack · 0.1
YearPublicationVenuePosition
2012 Understanding Adaptivity: Random Systems Revisited
Dimitar Jetchev, Onur Özen, Martijn Stam
ASIACRYPT2
2012 Collisions Are Not Incidental: A Compression Function Exploiting Discrete Geometry
Dimitar Jetchev, Onur Özen, Martijn Stam
TCC2
2011 Efficient Hashing Using the AES Instruction Set
Joppe W. Bos, Onur Özen, Martijn Stam
CHES2
2010 Collision Attacks against the Knudsen-Preneel Compression Functions
Onur Özen, Martijn Stam
ASIACRYPT1
2010 Attacking the Knudsen-Preneel Compression Functions
Onur Özen, Thomas Shrimpton, Martijn Stam
FSE1
2009 Lightweight Block Ciphers Revisited: Cryptanalysis of Reduced Round PRESENT and HIGHT
Onur Özen, Kerem Varici, Cihangir Tezcan, Çelebi Kocair
ACISP1
2009 Improved Cryptanalysis of Skein
Jean-Philippe Aumasson, Çagdas Çalik, Willi Meier, Onur Özen, Raphael C.-W. Phan, Kerem Varici
ASIACRYPT4
2009 Another Glance at Double-Length Hashing
Onur Özen, Martijn Stam
IMACC1
2009 Analysis and Optimization of Cryptographically Generated Addresses
Joppe W. Bos, Onur Özen, Jean-Pierre Hubaux
ISC2