Josep Lluís Ferrer-Gomila

An Efficient Protocol for Certified Electronic Mail

Certified electronic mail is a kind of fair exchange of values: a message for a receipt. An exchange is fair if at the end of the exchange, either each party receives the item it expects or neither party receives any useful information about the others item. Fairness can be achieved through the involvement of a trusted third party (TTP). It is very interesting (and practical) the optimistic approach of involving a third party only in the case of exceptions: one party cannot obtain the expected item from the other party. Previous solutions using this approach implicitly assumed that players had reliable communication channels to the third party [2]. In this paper, we present an efficient (only three steps, the minimum), optimistic and fair protocol for certified electronic mail.

Efficient Optimistic N-Party Contract Signing Protocol

Contract signing is a fundamental service in the environment of the electronic commerce. It is a kind of fair exchange of values: a signature on a text contract for another signature on the same text. We present a fair protocol that requires the existence and possible involvement of a TTP (trusted third party), but it only intervenes in case of exception (it plays a subsidiary role). The protocol is the best solution to the date in terms of efficiency. We present and analyse a two-party and three-party version of the protocol, and we outline an N-party version. Finally, it is very simple and easy to understand. If we think that at the end some conflicts will be solved in courts, it is a non worthless characteristic.

A Realistic Protocol for Multi-party Certified Electronic Mail

In some cases, users need to notify the same information to multiple recipients, with the requirement that these recipients have to send an acknowledgement of receipt. In this paper we present an optimistic protocol for multi-party certified electronic mail. A Trusted Third Party (TTP) can take part in a protocol run, but only in case of exception. Fairness is guaranteed for all parties being involved in a transaction. At the end of a protocol run, every party possesses enough evidence to prove the final state of the exchange. Parties can contact the TTP when they want (without temporal constraints). The presented protocol is the best one in terms of efficiency: only three steps have to be followed in the exchange sub-protocol.

An efficient anonymous scheme for secure micropayments

Micropayment systems allow payments of low value. Low cost for transaction is the main requirement for micropayments. For this reason, anonymity, a desired feature, is difficult to implement in micropayment systems. This paper presents an anonymous and untraceable micropayment system that offers low transactional costs while the use of secure protocols avoids financial risks. The efficient anonymity is achieved thanks to the use of a double spending prevention technique. Finally, the bank behavior can be verified.

Optimality in Asynchronous Contract Signing Protocols

Garay et alter [9] prove that for the multi-party contract signing with n participants, at least n rounds are necessary. To date, the best solution is Baum-Waidner’s scheme [6], with t+2 rounds (where t is the number of dishonest signatories, so with t=n–1, the number of rounds is n+1). Here, we propose an optimal solution with exactly n rounds. On the other hand, Pfitzmann et alter [10] state that “there is no asynchronous optimistic contract signing scheme with three messages in the optimistic case”. However, it seems that Ferrer et alter [7] invalidate the previous theorem with a counterexample, presenting an asynchronous protocol with only three messages. In this paper, we clarify this apparent contradiction.

Untraceable, anonymous and fair micropayment scheme

The development of new applications of electronic commerce (e-commerce) that require the payment of small amounts of money to purchase services or goods opens new challenges in the security and privacy fields. This kind of payments are called micropayments and they have to provide a tradeoff between efficiency and security requirements to pay low-value items. In this paper we present a new efficient and secure micropayment scheme which fulfils the security properties that guarantee no financial risk for merchants and the privacy of the customers. In addition, the proposed system defines a fair exchange between the micropayment and the desired good or service. In this fair exchange, the anonymity and untraceability of the customers are assured. Finally, customers can request a refund whether they are no more interested on the services offered by merchants.

Anonymous and Fair Micropayment Scheme with Protection against Coupon Theft

The development of new applications of electronic commerce (e-commerce) that require the payment of small amounts of money to purchase services or goods opens new challenges in the security and privacy fields. These payments are called micropayments and they provide a trade-off between efficiency and security requirements to pay low-value items. It is usual to assume low value fraud to achieve efficiency in micropayment systems. In this paper the authors present an improved version of an efficient and secure micropayment scheme which fulfils the security properties that guarantee no financial risk for merchants and the privacy of the customers. In addition, the proposed system defines a fair exchange between the coin and the desired good or service. In this fair exchange, the anonymity and untraceability of the customers are assured. Moreover, customers can request a refund whether they are no more interested on the services offered by merchants. As a novelty, an improvement of the scheme avoids customers to fraudulently use a refund operation to gain a little amount of money (called coupon). Thus, a new resolution subprotocol allows the merchant to avoid the loss of any single coupon.

A Secure Multicoupon Solution for Multi-merchant Scenarios

Electronic multicoupons are the equivalent of paper-based coupons booklets, offered to customers in order to achieve discounts or gifts from one or more merchants for goods or services. To date, most of the previous proposals have focused in scenarios where multiple customers can interact with a single merchant. But this restriction is a serious drawback for the expansion of the use of electronic coupons, since each customer needs a preestablished relationship with each merchant. In this paper, we propose a new multicoupon scheme for multi-merchant scenarios, preserving security properties of previous single merchant schemes, but enhancing the efficiency and the security of the few solutions that deal with multi-merchant scenarios.

MC-2D: An Efficient and Scalable Multicoupon Scheme

Electronic multicoupons are the digital version of paper-based booklet of coupons, which allow a customer to obtain goods or services from a merchant typically with discounts or gifts. In this paper, we propose a multicoupon scheme for multi-merchant environments that enhances the security and the efficiency as regards the previous solution that deals with this kind of scenario. On one hand, our scheme meets basic security requirements (unforgeability, reuse detection), but also unsplittability. This fact will help to increase the trust on the part of merchants. On the other hand, we focus on achieving a high degree of privacy for customers (anonymity, unlinkability, confidentiality) that will contribute to gaining the trust of the involved customers. Moreover, we provide measures to protect honest parties from dishonest participants, keeping in mind the scalability and efficiency of the multicoupon scheme, to attract customers and merchants. In addition, we show by implementation that our proposal outperforms previous solutions of this kind.

An Asynchronous Optimistic Protocol for Atomic Multi-Two-Party Contract Signing

The advances in the digital world (e.g. the Internet, Communications, etc.) are closing the gap between consumers and providers, in both Business to Consumer and Business to Business environments. Through the Internet, providers can offer their products directly to consumers, which increase their choices and allow them to contract a set of different services/products from different providers. But sometimes the consumer needs an all-or-nothing exchange with these providers: an atomic exchange. The consumer has negotiated/obtained a set of conditions that are only met if she acquires all the services/products. Thus, we need an Atomic Multi-Two-Party contract signing protocol. Even though digital signature of contracts is a topic that has been widely studied, it lacks a solution when applied to Atomic Multi-Two-Party scenarios. Here, we propose the first solution to solve this problem.