Results 1 - 10
of
65
Tropyc: A Pattern Language for Cryptographic Software
, 1999
"... This work describes Tropyc, a pattern language for cryptographic software based on a generic object-oriented cryptographic architecture. Nine patterns are described: Information Secrecy, Sender Authentication, Message Integrity, Signature, Signature with Appendix, Secrecy with Integrity, Secrecy ..."
Abstract
-
Cited by 34 (3 self)
- Add to MetaCart
This work describes Tropyc, a pattern language for cryptographic software based on a generic object-oriented cryptographic architecture. Nine patterns are described: Information Secrecy, Sender Authentication, Message Integrity, Signature, Signature with Appendix, Secrecy with Integrity, Secrecy with Sender Authentication, Secrecy with Signature, and Secrecy with Signature with Appendix. They are classified according to four fundamental objectives of cryptography (confidentiality, integrity, authentication and non-repudiation) and compose a closed set of patterns for this domain. These patterns have the same dynamic behavior and structure. We abstracted these aspects into a Generic Object-Oriented Cryptographic Architecture (GOOCA). Key words: cryptography, pattern language, design patterns, software architecture, object orientation. 1 Introduction Modern cryptography is been widely used in many applications, such as word processors, spreadsheets, databases, and electronic ...
Design, implementation, and deployment of the iKP secure electronic payment system
- IEEE Journal on Selected Areas in Communications
, 2000
"... 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 basedontheiKP family of protocols – i =1, 2, 3 – developed at IBM Research. The protocols implement credit cardbased transactions ..."
Abstract
-
Cited by 31 (2 self)
- Add to MetaCart
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 basedontheiKP family of protocols – i =1, 2, 3 – developed at IBM Research. The protocols implement credit cardbased 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 pre-cursor 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 – make 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.
A Taxonomy of Incentive Patterns - The Design Space of Incentives for Cooperation
, 2003
"... Peer-to-peer systems, multi-agent systems, and ad hoc networks aim at exploiting synergies that result from cooperation. Yet, these systems are composed of autonomous entities that are free to decide whether to cooperate or not. Hence, incentives are indispensable to induce cooperation between auton ..."
Abstract
-
Cited by 30 (5 self)
- Add to MetaCart
Peer-to-peer systems, multi-agent systems, and ad hoc networks aim at exploiting synergies that result from cooperation. Yet, these systems are composed of autonomous entities that are free to decide whether to cooperate or not. Hence, incentives are indispensable to induce cooperation between autonomous entities. In this paper, we introduce incentive patterns as a means of systematically conceiving incentive schemes with respect to the specifics of the application environment. Based on economic incentive patterns, we derive several incentive patterns and discuss them with respect to a set of general characteristics. Consequently, we propose a taxonomy that classifies the derived incentive patterns.
A cryptographically sound Dolev-Yao style security proof of the Otway-Rees protocol
- In Proc. 9th European Symposium on Research in Computer Security (ESORICS
, 2004
"... We present the first cryptographically sound Dolev-Yaostyle security proof of a comprehensive electronic payment system. The payment system is a slightly simplified variant of the 3KP payment system and comprises a variety of different security requirements ranging from basic ones like the impossibi ..."
Abstract
-
Cited by 25 (10 self)
- Add to MetaCart
(Show Context)
We present the first cryptographically sound Dolev-Yaostyle security proof of a comprehensive electronic payment system. The payment system is a slightly simplified variant of the 3KP payment system and comprises a variety of different security requirements ranging from basic ones like the impossibility of unauthorized payments to more sophisticated properties like disputability. We show that the payment system is secure against arbitrary active attacks, including arbitrary concurrent protocol runs and arbitrary manipulation of bitstrings within polynomial time if the protocol is implemented using provably secure cryptographic primitives. Although we achieve security under cryptographic definitions, our proof does not have to deal with probabilistic aspects of cryptography and is hence within the scope of current proof tools. The reason is that we exploit a recently proposed Dolev-Yao-style cryptographic library with a provably secure cryptographic implementation. Together with composition and preservation theorems of the underlying model, this allows us to perform the actual proof effort in a deterministic setting corresponding to a slightly extended Dolev-Yao model. 1.
Classification and Characteristics of Electronic Payment Systems
- Lecture Notes in Computer Science
, 2001
"... Electronic commerce and electronic business greatly need new payment systems that will support their further development. To better understand problems and perspectives of the electronic payment systems this article describes a classification and different characteristic aspects of payment system ..."
Abstract
-
Cited by 24 (3 self)
- Add to MetaCart
(Show Context)
Electronic commerce and electronic business greatly need new payment systems that will support their further development. To better understand problems and perspectives of the electronic payment systems this article describes a classification and different characteristic aspects of payment systems.
Preserving Mobile Customer Privacy: An Access Control System for Moving Objects and Customer Profiles
- In Proceedings of the 6th MDM ’05
, 2005
"... A key challenge for Mobile services is to offer personalized contents while preserving the privacy of customers. In mobile applications, location information is modeled as moving objects. Providing proper protection to customer information can be achieved by an access control system. However, provid ..."
Abstract
-
Cited by 23 (5 self)
- Add to MetaCart
(Show Context)
A key challenge for Mobile services is to offer personalized contents while preserving the privacy of customers. In mobile applications, location information is modeled as moving objects. Providing proper protection to customer information can be achieved by an access control system. However, providing such system is a challenging task due to: 1) the spatio-temporal nature of the constraints as well as the location information, and the interaction among them; 2) the complexity of resolving spatiotemporal and granularity conflicts; and 3) the required scalability and efficiency. In this paper, we present a solution that includes an access control model for moving objects and customer profiles. We also present a mechanism that enforces the spatio-temporal policies. The mechanism consists of three components: a text encoder, a spatio-temporal module that computes interactions between moving objects and spatio-temporal constraints, and a new data structure referred to as the Adaptive Search Multi-way trie (ASM-trie). We present the insertion and search algorithms of the ASM-trie and an evaluation study that shows the positive impact of the ASM-trie on the search efficiency.
Stimulating Cooperative Behavior of Autonomous Devices -- An Analysis of Requirements and Existing Approaches
- IN SECOND INTERNATIONAL WORKSHOP ON WIRELESS INFORMATION SYSTEMS (WIS2003
, 2003
"... In the context of mobile and wireless devices, an information system is no longer a centralized component storing all the relevant data nor is it a decentralized component governed by a common authority. Rather, the information spread across huge numbers of autonomous mobile and wireless devices own ..."
Abstract
-
Cited by 19 (8 self)
- Add to MetaCart
In the context of mobile and wireless devices, an information system is no longer a centralized component storing all the relevant data nor is it a decentralized component governed by a common authority. Rather, the information spread across huge numbers of autonomous mobile and wireless devices owned by independent organizations and individuals can be regarded as a highly dynamic, virtual information system. For this vision to become reality, the autonomous devices involved need to be motivated to cooperate. This cooperation needs to occur not only on the application layer, but, depending on the network architecture, also on the lower layers from the link layer on upwards. In this paper, we investigate on which protocol layers cooperation is needed and what constitutes uncooperative behavior. We then identify necessary properties of incentive schemes that encourage cooperation and discourage uncooperative behavior. In this context, we examine remuneration types that are a major constituent of incentive schemes. Finally, using the example of ad hoc networks, the most challenging technical basis of a wireless information system, we compare existing incentive schemes to these characteristics.
Digital-Ticket-Controlled Digital Ticket Circulation
, 1999
"... This paper presents a new digital-ticket circulating scheme and trust management scheme for a digital ticket. A digital ticket is a digital medium that guarantees certain rights of the owner and it includes software licenses, resource access tickets, event tickets, and plane tickets. The circulatio ..."
Abstract
-
Cited by 14 (2 self)
- Add to MetaCart
This paper presents a new digital-ticket circulating scheme and trust management scheme for a digital ticket. A digital ticket is a digital medium that guarantees certain rights of the owner and it includes software licenses, resource access tickets, event tickets, and plane tickets. The circulation of digital tickets comprises three types of principal transactions: issuance, transfer, and redemption. Depending on the application, various conditions must be satisfied to execute these transactions, e.g., only qualified shops can issue the tickets and only a certain agent can transfer the tickets. This paper introduces circulation control tickets, which are required to issue, transfer, redeem a ticket, and proposes specifying the required control ticket types in the ticket to be circulated itself using the Generalized Ticket Definition Language. The ticket circulating system issues, transfers, or redeems a ticket only if the control tickets are owned by the participants of the transacti...
General-purpose Digital Ticket Framework
, 1998
"... A digital ticket is a certificate that guarantees certain rights of the ticket owner. There are many applications for digital tickets but the ticket properties vary depending on the application. This variety makes the digital ticket processing system expensive, especially if dedicated systems must b ..."
Abstract
-
Cited by 12 (2 self)
- Add to MetaCart
A digital ticket is a certificate that guarantees certain rights of the ticket owner. There are many applications for digital tickets but the ticket properties vary depending on the application. This variety makes the digital ticket processing system expensive, especially if dedicated systems must be developed for each application. This paper thus addresses issues on developing a common data schema and processing architecture for various types of digital tickets. This paper clarifies requirements for a general-purpose digital ticket and shows four features in contrast to digital cash: 1) parameterization of ticket properties on anonymity, transferability, and divisibility; 2) machineunderstandability of ticket contents; 3) statetransitionality of ticket status; and 4) composability of multiple tickets. To achieve parameterization of ticket properties and machine-understandability, we propose a Resource Description Framework (RDF)-based ticket description method. Its metadata facility e...
Usable Optimistic Fair Exchange
"... Fairly exchanging digital content is an everyday problem. It has been shown that fair exchange cannot be done without a trusted third party (called the Arbiter). Yet, even with a trusted party, it is still non-trivial to come up with an efficient solution, especially one that can be used in a p2p fi ..."
Abstract
-
Cited by 11 (7 self)
- Add to MetaCart
(Show Context)
Fairly exchanging digital content is an everyday problem. It has been shown that fair exchange cannot be done without a trusted third party (called the Arbiter). Yet, even with a trusted party, it is still non-trivial to come up with an efficient solution, especially one that can be used in a p2p file sharing system with a high volume of data exchanged. We provide an efficient optimistic fair exchange mechanism for bartering digital files, where receiving a payment in return to a file (buying) is also considered fair. The exchange is optimistic, removing the need for the Arbiter’s involvement unless a dispute occurs. While the previous solutions employ costly cryptographic primitives for every file or block exchanged, our protocol employs them only once per peer, therefore achieving O(n) efficiency improvement when n blocks are exchanged between two peers. The rest of our protocol uses very efficient cryptography, making it perfectly suitable for a p2p file sharing system where tens of peers exchange thousands of blocks and they do not know beforehand which ones they will end up exchanging. Therefore, our system yields to one-two orders of magnitude improvement in terms of both computation and communication (40 seconds vs. 42 minutes, 1.6MB vs. 200MB). Thus, for the first time, a provably secure (and privacy respecting when payments are made using e-cash) fair exchange protocol is being used in real bartering applications (e.g., BitTorrent) [14] without sacrificing performance. Keywords: optimistic fair exchange, barter, peer-to-peer file sharing, BitTorrent.
