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

Ralf C. Hauser

dblp:17/2186 · DBLP profile ↗
← Back
7ranked-venue papers
6as first author
0since 2021 · last 2000
—ORCID · none

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

Security and privacy · 5 · 5 first-authorComputer networks · 2 · 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
3 papers
Cryptographic protocols and secure computation · 41% Network security · 27% Cryptographic primitives and cryptanalysis · 16%
Computer networks
1 paper
Routing and switching · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
secure payment
0.012000
Design, implementation, and deployment of the iKP secure electronic payment system · IEEE J. Sel. Areas Commun. 2000
Routing and switching › routing protocol
link-state routing
0.011997
Reducing the Cost of Security in Link-State Routing · NDSS 1997
Network security
routing security
0.011997
Reducing the Cost of Security in Link-State Routing · NDSS 1997
Cryptographic primitives and cryptanalysis › boolean functions
strict avalanche criterion
0.011993
Does Licensing Require New Access Control Techniques? · CCS 1993
Routing and switching › routing
secure routing
0.011997
Reducing the Cost of Security in Link-State Routing · NDSS 1997
Malware analysis
anti-virus
0.011993
Does Licensing Require New Access Control Techniques? · CCS 1993

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

digital signature · 0.0cryptographic authentication · 0.0public-key cryptography · 0.0protocol design · 0.0deployment study · 0.0license brokerage architecture · 0.0access control extension · 0.0
YearPublicationVenuePosition
2000 Design, implementation, and deployment of the iKP secure electronic payment system
abstract
This paper discusses the design, implementation, and deployment of a secure and practical payment system for electronic commerce on the Internet. The system is based on the iKP family of protocols-(i=1,2,3)-developed at IBM Research. The protocols implement credit card-based transactions between buyers and merchants while the existing financial network is used for payment clearing and authorization. The protocols are extensible and can be readily applied to other account-based payment models, such as debit cards. They are based on careful and minimal use of public-key cryptography, and can be implemented in either software or hardware. Individual protocols differ in both complexity and degree of security. In addition to being both a precursor and a direct ancestor of the well-known SET standard, iKP-based payment systems have been in continuous operation on the Internet since mid-1996. This longevity-as well as the security and relative simplicity of the underlying mechanisms-makes the iKP experience unique. For this reason, this paper also reports on, and addresses, a number of practical issues arising in the course of implementation and real-world deployment of a secure payment system.
Mihir Bellare, Juan A. Garay 0001, Ralf C. Hauser, Amir Herzberg, Hugo Krawczyk, Michael Steiner 0001, Gene Tsudik, Els Van Herreweghen, Michael Waidner
IEEE J. Sel. Areas Commun.3
1999 Lowering security overhead in link state routing
Ralf C. Hauser, Tony Przygienda, Gene Tsudik
Comput. Networks1
1997 Reducing the Cost of Security in Link-State Routing
abstract
Security in link-state routing protocols is a feature that is both desirable and costly. This paper examines the cost of security and presents two techniques for efficient and secure processing of link state updates. The first technique is geared towards a relatively stable internetwork environment while the second is designed with a more volatile environment in mind.
Ralf C. Hauser, Tony Przygienda, Gene Tsudik
NDSS1
1996 Robust and Secure Password and Key Change Method
abstract
This paper discusses issues and idiosyncrasies associated with changing passwords and keys in distributed computer systems. Current approaches are often complicated and fail to provide the desired level of security and fault tolerance. A novel and ve
Ralf C. Hauser, Philippe A. Janson, Refik Molva, Gene Tsudik, Els Van Herreweghen
J. Comput. Secur.1
1994 Robust and Secure Password and Key Change Method
Ralf C. Hauser, Philippe A. Janson, Refik Molva, Gene Tsudik, Els Van Herreweghen
ESORICS1
1993 Does Licensing Require New Access Control Techniques?
abstract
Licensing is a topic of increasing importance for software publishers and users. More and more, the magnitude of financial transfers between these two partners are determined by some electronic licensing service being part of the system on which the licensed software is running. In order to ease the use and management of such licensing schemes and to enable economic software usage in enterprise-wide computer systems through flexible and fair billing structures, various organizations are working on formulating requirements, defining architectures, and building standard interfaces for so called license brokerage systems. The trustworthiness of these services is essential because large amounts of money can depend on them. Most of these licensing services are currently operating independently of access control and rely on proprietary and unpublished security algorithms. This paper proposes an extension of access control to integrate licensing called Stateful Access Control and it addresses some aspects of virus protection.
Ralf C. Hauser
CCS1
1992 Verification and Modelling of Authentication Protocols
Ralf C. Hauser, E. Stewart Lee
ESORICS1