Mohammad Torabi Dashti
Abstract
Efficiency of asynchronous optimistic fair exchange using trusted devices is studied. It is shown that three messages in the optimistic subprotocol are sufficient and necessary for exchanging idempotent items. When exchanging nonidempotent items, however, three messages in the optimistic subprotocol are sufficient only under the assumption that trusted devices have unbounded storage capacity. This assumption is often not satisfiable in practice. It is then proved that exchanging nonidempotent items using trusted devices with a bounded storage capacity requires exactly four messages in the optimistic subprotocol.
- Alpern, B. and Schneider, F. 1985. Defining liveness. Inf. Process. Lett. 21, 4, 181--185.Google Scholar
Cross Ref
- Asokan, N. 1998. Fairness in electronic commerce. Ph.D. thesis, University of Waterloo. Google ScholarDigital Library
- Chandy, K. and Misra, J. 1986. How processes learn. Distrib. Comput. 1, 1, 40--52. Google ScholarDigital Library
- Chor, B., Fiat, A., Naor, M., and Pinkas, B. 2000. Tracing traitors. IEEE Trans. Inf. Theory 46, 3, 893--910. Google ScholarDigital Library
- Dolev, D. and Yao, A. C. 1983. On the security of public key protocols. IEEE Trans. Inf. Theory IT-29, 2, 198--208. Google ScholarDigital Library
- Even, S. and Yacobi, Y. 1980. Relations among public key signature systems. Tech. rep. 175, Computer Science Department, Technion, Haifa, Isreal.Google Scholar
- Ezhilchelvan, P. D. and Shrivastava, S. K. 2005. A family of trusted third party based fair-exchange protocols. IEEE Trans. Dependable Secur. Comput. 2, 4, 273--286. Google ScholarDigital Library
- Fagin, R., Halpern, J., Moses, Y., and Vardi, M. 1995. Reasoning About Knowledge. MIT Press, Cambridge, MA. Google ScholarDigital Library
- Fort, M., Freiling, F., Draque Penso, L., Benenson, Z., and Kesdogan, D. 2006. TrustedPals: Secure multiparty computation implemented with smart cards. In Proceedings of the European Symposium on Research in Computer Society (ESORICS'06). Lecture Notes in Computer Science, vol. 4189. Springer, 34--48. Google ScholarDigital Library
- Francez, N. 1986. Fairness. Springer. Google ScholarDigital Library
- Fujimura, K. and Eastlake, D. 2003. Requirements and design for voucher trading system (VTS). RFC 3506. Google ScholarDigital Library
- Fujimura, K., Kuno, H., Terada, M., Matsuyama, K., Mizuno, Y., and Sekine, J. 1999. Digital-Ticket-Controlled digital ticket circulation. In Proceedings of the USENIX Security '99 Conference. 229--240. Google ScholarDigital Library
- Gray, J. 1978. Notes on data base operating systems. In Operating Systems, An Advanced Course. Lecture Notes in Computer Science, vol. 60. Springer, 393--481. Google ScholarDigital Library
- Guerraoui, R. and Rodrigues, L. 2006. Introduction to Reliable Distributed Programming. Springer. Google ScholarDigital Library
- Kuntze, N. and Schmidt, A. 2007. Trusted ticket systems and applications. In Proceedings of the Information Security IFIP SEC'07 Conference. IFIP, vol. 232. Springer, 49--60.Google Scholar
- Mauw, S., Radomirovic, S., and Torabi Dashti, M. 2009. Minimal message complexity of asynchronous multi-party contract signing. In Proceedings of the IEEE Computer Society Foundations Symposium (CSF'09). IEEE CS, 13--25. Google ScholarDigital Library
- Micali, S. 2003. Simple and fast optimistic protocols for fair electronic exchange. In Proceedings of the ACM SIGACT PODC '03 SIGOPS Symposium on Principles of Distributed Computing. ACM Press, 12--19. Google ScholarDigital Library
- Pagnia, H., Vogt, H., and Gärtner, F. C. 2003. Fair exchange. Comput. J. 46, 1, 55--7.Google ScholarCross Ref
- Pfitzmann, B., Schunter, M., and Waidner, M. 1998. Optimal efficiency of optimistic contract signing. In Proceedings of the ACM SIGACT PODC '98 SIGOPS Symposium on Principles of Distributed Computing. ACM Press, 113--122. Google ScholarDigital Library
- Schunter, M. 2000. Optimistic fair exchange. Ph.D. thesis, Universität des Saarlandes.Google Scholar
- Terada, M., Mori, K., Ishii, K., Hongo, S., Usaka, T., Koshizuka, N., and Sakamura, K. 2006. A framework for distributed inter-smartcard communication. IPSJ Digit. Cour. 2, 120--132.Google ScholarCross Ref
- Torabi Dashti, M. and Mauw, S. 2010. Handbook of Financial Cryptography and Security. G. Rosenberg, Ed., Chapmand and Hall/CRC, 109--132. Google ScholarDigital Library
- Torabi Dashti, M., Nair, S. K., and Jonker, H. 2008. Nuovo DRM Paradiso: Designing a secure, verified, fair exchange DRM scheme. Fundam. Inf. 89, 4, 393--417. Google ScholarDigital Library
- Tygar, J. 1996. Atomicity in electronic commerce. In Proceedings of the ACM SIGACT PODC '96 SIGOPS Symposium on Principles of Distributed Computing. ACM Press, 8--26. Google ScholarDigital Library
- Vogt, H. 2003. Asynchronous optimistic fair exchange based on revocable items. In Financial Cryptography. Lecture Notes in Computer Science, vol. 2742. Springer, 208--222.Google Scholar
- Vogt, H., Pagnia, H., and Gärtner, F. C. 2001. Using smart cards for fair exchange. In Electronic Commerce'01. Lecture Notes in Computer Science, vol. 2232. Springer, 101--113. Google ScholarDigital Library
Index Terms
- Efficiency of optimistic fair exchange using trusted devices
Recommendations
Optimistic Fair Exchange Using Trusted Devices
SSS '09: Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed SystemsEfficiency of optimistic fair exchange using trusted devices is studied. Pfitzmann, Schunter and Waidner (<Emphasis Type="SmallCaps">podc</Emphasis> 1998) have shown that four messages in the main sub-protocol is optimal when exchanging idempotent items ...
An Abuse-Free Optimistic Fair Exchange Protocol Based on BLS Signature
CIS '08: Proceedings of the 2008 International Conference on Computational Intelligence and Security - Volume 02The fair exchange protocol is one of the most fundamental cryptographic tool in many security applications such as contract signing protocols, certified e-mail systems, and e-payment schemes. BLS short signature (due to Boneh, Lynn, and Shacham) is ...
Attribute-based optimistic fair exchange: How to restrict brokers with policies
Optimistic fair exchange (OFE) is a kind of protocols for solving the fair exchange problem between two participants with the help of an arbitrator that only needs to be involved when dispute occurs. As far as we are concerned, all previous work on OFE ...
Comments