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

Uta Wille

dblp:89/2201 · also Uta Wille Jelmol · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2000
0000-0003-1756-5449ORCID · corroborated

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

Databases, data management, data science and information retrieval · 2Artificial intelligence and machine learning · 1Security and privacy · 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
1 paper
Cryptographic protocols and secure computation · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
communication complexity		 0.011998
Communication Complexity of Group Key Distribution · CCS 1998
Cryptographic protocols and secure computation › key management › key distribution
group key distribution		 0.011998
Communication Complexity of Group Key Distribution · CCS 1998
Cryptographic protocols and secure computation
key exchange		 0.011998
Communication Complexity of Group Key Distribution · CCS 1998
YearPublicationVenuePosition
2000 Conceptual Information Systems Discussed through in IT-Security Tool
Gerd Stumme, Rudolf Wille, Uta Wille, Monika Zickwolff
 EKAW4
1998 Communication Complexity of Group Key Distribution
abstract
Communication complexity has al~vays been an important issue Ivhen designing group key distribution systems.This paper systematically studies \vhat can be achieved for the most common measures of protocol complexity.Lo\ver bounds for the total number of messages, the total number of exchanges, and the number of necwsary rounds are established, ~vherebymodels that allo~vbroadcasting have to be distinguished from those that do not.For every measure of protocol complexity, we furthermore show that the corresponding bound is realistic for DiffieHellmau-based prot~ COIS by referring to or introducing protocols that match the bound or exceed it by only one.-..
Uta Wille
 CCS2
1998 Conceptual Knowledge Discovery in Databases Using Formal Concept Analysis Methods
Gerd Stumme, Rudolf Wille, Uta Wille
 PKDD3