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 SIGIR 2026 / reviewers in the wild / expert

Jason K. Resch

dblp:17/9511 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-authorSecurity and privacy · 1Databases, 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
2 papers
Cryptographic protocols and secure computation · 97% Cryptographic primitives and cryptanalysis · 3%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Storage systems · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
key management		 0.412019
Updatable Oblivious Key Management for Storage Systems · CCS 2019
Cryptographic protocols and secure computation › key management
oblivious key management		 0.412019
Updatable Oblivious Key Management for Storage Systems · CCS 2019
Cryptographic protocols and secure computation
oblivious pseudorandom function		 0.412019
Updatable Oblivious Key Management for Storage Systems · CCS 2019
Cryptographic primitives and cryptanalysis › symmetric cryptography
all-or-nothing transform		 0.012011
AONT-RS: Blending Security and Performance in Dispersed Storage Systems · FAST 2011

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

threshold implementation · 0.8oblivious pseudorandom function · 0.8
YearPublicationVenuePosition
2019 Updatable Oblivious Key Management for Storage Systems
abstract
We introduce Oblivious Key Management Systems (KMS) as a much more secure alternative to traditional wrapping-based KMS that form the backbone of key management in large-scale data storage deployments. The new system, that builds on Oblivious Pseudorandom Functions (OPRF), hides keys and object identifiers from the KMS, offers unconditional security for key transport, provides key verifiability, reduces storage, and more. Further, we show how to provide all these features in a distributed threshold implementation that enhances protection against server compromise.
Stanislaw Jarecki, Hugo Krawczyk, Jason K. Resch
 CCS3
2011 AONT-RS: Blending Security and Performance in Dispersed Storage Systems
Jason K. Resch, James S. Plank
 FAST1