96 research outputs found
Cryptanalysis of the RSA-CEGD protocol
Recently, Nenadi\'c et al. (2004) proposed the RSA-CEGD protocol for
certified delivery of e-goods. This is a relatively complex scheme based on
verifiable and recoverable encrypted signatures (VRES) to guarantee properties
such as strong fairness and non-repudiation, among others. In this paper, we
demonstrate how this protocol cannot achieve fairness by presenting a severe
attack and also pointing out some other weaknesses.Comment: 8 pages, 1 figur
Fair exchange in e-commerce and certified e-mail, new scenarios and protocols
We are witnessing a steady growth in the use of Internet in the electronic commerce field. This rise is promoting the migration from traditional processes and applications (paper based) to an electronic model. But the security of electronic transactions continues to pose an impediment to its implementation. Traditionally, most business transactions were conducted in person. Signing a contract required the meeting of all interested parties, the postman delivered certified mail in hand, and when paying for goods or services both customer and provider were present. When all parties are physically present, a transaction does not require a complex protocol. The participants acknowledge the presence of the other parties as assurance that they will receive their parts, whether a signature on a contract, or a receipt, etc. But with e-commerce growing in importance as sales and business channel, all these transactions have moved to its digital counterpart. Therefore we have digital signature of contracts, certified delivery of messages and electronic payment systems. With electronic transactions, the physical presence is not required,moreover, most of the times it is even impossible. The participants in a transaction can be thousands of kilometers away from each other, and they may not even be human participants, they can be machines. Thus, the security that the transaction will be executed without incident is not assured per se, we need additional security measures. To address this problem, fair exchange protocols were developed. In a fair exchange every party involved has an item that wants to exchange, but none of the participants is willing to give his item away unless he has an assurance he will receive the corresponding item from the other participants. Fair exchange has many applications, like digital signature of contracts, where the items to be exchanged are signatures on contracts, certified delivery of messages, where we exchange a message for evidence of receipt, or a payment process, where we exchange a payment (e-cash, e-check, visa, etc.) for digital goods or a receipt. The objective of this dissertation is the study of the fair exchange problem. In particular, it presents two new scenarios for digital contracting, the Atomic Multi- Two Party (AM2P) and the Agent Mediated Scenario (AMS), and proposes one optimistic contract signing protocol for each one. Moreover, it studies the efficiency of Multi-Party Contract Signing (MPCS) protocols from their architecture point of view, presenting a new lower bound for each architecture, in terms of minimum number of transactions needed. Regarding Certified Electronic Mail (CEM), this dissertation presents two optimistic CEMprotocols designed to be deployed on thecurrent e-mail infrastructure, therefore they assume the participation of multiple Mail Transfer Agents (MTAs). In one case, the protocol assumes untrusted MTAs whereas in the other one it assumes each User Agent (UA) trusts his own MTA. Regarding payment systems, this dissertation presents a secure and efficient electronic bearer bank check scheme allowing the electronic checks to be transferred fairly and anonymously.L’ús d’Internet en l’à mbit del comerç electrònic està experimentant un creixement estable. Aquest increment d’ús està promovent lamigració de processos tradicionals i aplicacions (basades en paper) cap a un model electrònic. Però la seguretat de les transaccions electròniques continua impedint la seva implantació. Tradicionalment, la majoria de les transaccions s’han dut a terme en persona. La firma d’un contracte requeria la presència de tots els firmants, el carter entrega les cartes certificades enmà , i quan es paga per un bé o servei ambdós venedor i comprador hi són presents. Quan totes les parts hi són presents, les transaccions no requereixen un protocol complex. Els participants assumeixen la presència de les altres parts com assegurança que rebran el que esperen d’elles, ja sigui la firma d’un contracte, un rebut d’entrega o un pagament. Però amb el creixement del comerç electrònic com a canal de venda i negoci, totes aquestes transaccions s’hanmogut al seu equivalent en el món electrònic. Aixà doncs tenim firma electrònica de contractes, enviament certificat de missatges, sistemes de pagament electrònic, etc. En les transaccions electròniques la presència fÃsica no és necessà ria, de fet, la majoria de vegades és fins it tot impossible. Els participants poden estar separats permilers de kilòmetres, i no és necessari que siguin humans, podrien sermà quines. Llavors, la seguretat de que la transacció s’executarà correctament no està assegurada per se, necessitem proporcionar mesures de seguretat addicionals. Per solucionar aquest problema, es van desenvolupar els protocols d’intercanvi equitatiu. En un intercanvi equitatiu totes les parts involucrades tenen un objecte que volen intercanviar, però cap de les parts implicades vol donar el seu objecte si no té la seguretat que rebrà els objectes de les altres parts. L’intercanvi equitatiu té multitud d’aplicacions, com la firma electrònica de contractes, on els elements a intercanviar son firmes de contractes, enviament certificat demissatges, on s’intercanvien unmissatge per una evidència de recepció, o un procés de pagament, on intercanviemun pagament (e-cash, visa, e-xec, etc.) per bens digitals o per un rebut. L’objectiu d’aquesta tesi és estudiar el problema de l’intercanvi equitatiu. En particular, la tesi presenta dos nous escenaris per a la firma electrònica de contractes, l’escenari multi-two party atòmic i l’escenari amb agents intermediaris, i proposa un protocol optimista per a cada un d’ells. A més, presenta un estudi de l’eficiència dels protocols de firma electrònica multi-part (Multi-Party Contract Signing (MPCS) protocols) des del punt de vista de la seva arquitectura, presentant una nova fita per a cada una, en termes de mÃnim nombre de transaccions necessà ries. Pel que fa al correu electrònic certificat, aquesta tesi presenta dos protocols optimistes dissenyats per a ser desplegats damunt l’infraestructura actual de correu electrònic, per tant assumeix la participació demúltiples agents de transferència de correu. Un dels protocols assumeix que cap dels agents de transferència de correu participants és de confiança,mentre que l’altre assumeix que cada usuari confia en el seu propi agent. Pel que fa a sistemes de pagament, la tesi presenta un esquema de xec bancari al portador, eficient i segur, que garanteix que la transferència dels xecs es fa demanera anònima i equitativa
Recommended from our members
DT-CP: a double-TTPs based contract-signing protocol with lower computational cost
This paper characterizes a contract signing protocol with high efficiency in Internet of Things. Recent studies show that existing contract-signing protocols can achieve abuse-freeness and resist inference attack, but cannot meet the high-efficiency and convenience requirement of the future Internet of things applications. To solve this problem, we propose a novel contract-signing protocol. Our proposed protocol includes two main parts: 1) we use the partial public key of the sender, instead of the zero-knowledge protocol, to verify the intermediate result; 2) we employ two independent Trusted Third Parties (TTPs) to prevent the honest-but-curious TTP. Our analysis shows that our double TTP protocol can not only result in lower computational cost, but also can achieve abuse-freeness with trapdoor commitment scheme. In a word, our proposed scheme performs better than the state of the art in terms of four metrics: encryption time, number of exponentiations, data to be exchanged and exchange steps in one round contract-signing
Unfairness of a protocol for certified delivery
Recently, Nenadić \emph{et al.} (2004) proposed the RSA-CEGD
protocol for certified delivery of e-goods. This is a relatively
complex scheme based on verifiable and recoverable encrypted
signatures (VRES) to guarantee properties such as strong fairness
and non-repudiation, among others. In this paper, we demonstrate how
this protocol cannot achieve fairness by presenting a severe attack
and also pointing out some other weaknesses
A P2P Optimistic Fair Exchange (OFE) Scheme For Personal Health Records Using Blockchain Technology
In today’s digital world, it is common to exchange sensitive data between different parties. There are many examples of sensitive data or documents that require a digital exchange, such as banking information, insurance data, health records. In many cases, the exchange exists between unknown and untrusted parties. Therefore, it is essential to execute the data exchange over a fair non-repudiation protocol. In digital communication, non-repudiation is undeniable evidence of one’s responsibility regarding the validity of any data he shares/receives. Usually, this is achieved by the use of a cryptographic digital signature. In this case, the parties cannot deny the authenticity of their digital signature. The protocol satisfies the fairness property if and only if it does not give the sender any advantages over the receiver or vice versa, at any step during the exchange process. Combining fair exchange and non-repudiation for digital exchange is critical in many applications and can be acquired with or without the involvement of any trusted third party (TTP). However, without the involvement of TTP, fairness becomes probabilistic, and the involvement of TTP can cause significant dependency on the third party. Therefore, a peer-to-peer (P2P) (aka offline) fair non-repudiation protocol that does not require a trusted third-party is desirable in many applications. Blockchain is designed in such a way that the network can handle the trustless environment and deliver the correct result. Thus, if the exchanges are done leveraging Blockchain, it will ensure true fairness, and at the same time, none of the participants have to deal with the trust issue. In this thesis we propose a P2P fair non-repudiation data exchange scheme by leveraging Blockchain and distributed ledger technology. The scheme combines on-chain and off-chain communication patterns to enable the exchange of personal health records between patients and healthcare providers. We provide an informal reasoning of the proposed scheme. Moreover, we propose a design and implementation agnostic to existing Blockchain platforms to enable unbiased evaluation of the proposed scheme. Finally, we make a comparative analysis of the result derived from our approach with the existing one
Design and implementation of extensible middleware for non-repudiable interactions
PhD ThesisNon-repudiation is an aspect of security that is concerned with the creation of irrefutable audits of
an interaction. Ensuring the audit is irrefutable and verifiable by a third party is not a trivial task.
A lot of supporting infrastructure is required which adds large expense to the interaction. This
infrastructure comprises, (i) a non-repudiation aware run-time environment, (ii) several purpose
built trusted services and (iii) an appropriate non-repudiation protocol. This thesis presents design
and implementation of such an infrastructure. The runtime environment makes use of several trusted
services to achieve external verification of the audit trail. Non-repudiation is achieved by executing
fair non-repudiation protocols. The Fairness property of the non-repudiation protocol allows a
participant to protect their own interests by preventing any party from gaining an advantage by
misbehaviour. The infrastructure has two novel aspects; extensibility and support for automated
implementation of protocols.
Extensibility is achieved by implementing the infrastructure in middleware and by presenting a
large variety of non-repudiable business interaction patterns to the application (a non-repudiable
interaction pattern is a higher level protocol composed from one or more non-repudiation protocols).
The middleware is highly configurable allowing new non-repudiation protocols and interaction
patterns to be easily added, without disrupting the application.
This thesis presents a rigorous mechanism for automated implementation of non-repudiation
protocols. This ensures that the protocol being executed is that which was intended and verified
by the protocol designer. A family of non-repudiation protocols are taken and inspected. This
inspection allows a set of generic finite state machines to be produced. These finite state machines
can be used to maintain protocol state and manage the sending and receiving of appropriate protocol
messages.
A concrete implementation of the run-time environment and the protocol generation techniques is
presented. This implementation is based on industry supported Web service standards and services.EPSRC, The Hewlett Packard Arjuna La
Optimally Efficient Multi-Party Fair Exchange and Fair Secure Multi-Party Computation
Multi-party fair exchange (MFE) and fair secure multi-party computation (fair SMPC)
are is under-studied field of research, with practical importance. In particular, we consider
MFE scenarios where at the end of the protocol, either every participant receives every
other participant’s item, or no participant receives anything. We analyze the case where
a trusted third party (TTP) is optimistically available, although we emphasize that the
trust put on the TTP is only regarding the fairness, and our protocols preserve the privacy
of the exchanged items against the TTP. In the fair SMPC case, we prove that a malicious
TTP can only harm fairness, but not security.
We construct two asymptotically optimal multi-party fair exchange protocols that require
a constant number of rounds (in comparison to linear) and O(n^2) messages (in
comparison to cubic), where n is the number of participating parties. In one protocol,
we enable the parties to efficiently exchange any item that can be efficiently put into a
verifiable encryption (e.g., signatures on a contract). We show how to apply this protocol
on top of any SMPC protocol to achieve fairness with very little overhead (independent
of the circuit size), especially if the SMPC protocol works with arithmetic circuits. In
our other protocol, we let the parties exchange any verifiable item, without the constraint
that it must be efficiently put into a verifiable encryption (e.g., a file cannot be efficiently
verifiably encrypted, but if its hash is known, once obtained, the file can be verified).
We achieve this via the use of electronic payments, where if an item is not obtained, the
payment of its owner will be obtained in return of the item that is sent. We then generalize
our protocols to efficiently handle any exchange topology (participants exchange
items with arbitrary other participants). Our protocols guarantee fairness in its strongest
sense: even if all n-1 other participants are malicious and colluding with each other, the
fairness is still guaranteed
Keeping Fairness Alive : Design and formal verification of optimistic fair exchange protocols
Fokkink, W.J. [Promotor]Pol, J.C. van de [Promotor
- …