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

Marcus Otten

dblp:50/2262 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none

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

Security and privacy · 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
2 papers
Cryptographic protocols and secure computation · 73% Privacy and data protection · 27%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › key management
key escrow
0.011994
Towards Acceptable Key Escrow Systems · CCS 1994
Cryptographic protocols and secure computation
secret sharing
0.011993
Verifiable Secret Sharing for Monotone Access Structures · CCS 1993
Cryptographic protocols and secure computation › secret sharing
verifiable secret sharing
0.011993
Verifiable Secret Sharing for Monotone Access Structures · CCS 1993

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

cryptographic protocol design · 0.0polynomial interpolation · 0.0finite geometry · 0.0
YearPublicationVenuePosition
1994 Towards Acceptable Key Escrow Systems
abstract
Escrowed Key Cryptosystems hold the promise of faithfully realizing legal guarantees of privacy for users under normal circumstances while at the same time insuring that privacy can be breached by authorities in special circumstances under appropriate legal safeguards. The most attractive feature of these schemes is that it is possible to ensure that the interests of each of the parties—the users, the law enforcement or national security agencies, the court or other monitoring entities and the escrow agents—can all be guaranteed up to the level of integrity of the protocol or cryptosystem. Unfortunately, the first scheme to attempt this, the Clipper protocol as adopted by the U.S., completely fails to do so for either the user(s) or for the monitoring entities. In this paper a new escrowed key protocol and new devices are described that verifiable protect the interests of all parties by positively implementing legal guarantees of privacy and access.
Thomas Beth, Hans-Joachim Knobloch, Marcus Otten, Gustavus J. Simmons, Peer Wichmann
CCS3
1993 Verifiable Secret Sharing for Monotone Access Structures
abstract
Several verifiable secret sharing schemes for threshold schemes based on polynomial interpolation have been presented in the literature. Simmons and others introduced secret sharing (also called shared control) schemes based on finite geometries, which allow istributing a secret according to any monotone access structure.
Thomas Beth, Hans-Joachim Knobloch, Marcus Otten
CCS3