Jose A. Onieva
Jianying Zhou
Skip Abstract Section
Abstract
Nonrepudiation is a security service that plays an important role in many Internet applications. Traditional two-party nonrepudiation has been studied intensively in the literature. This survey focuses on multiparty scenarios and provides a comprehensive overview. It starts with a brief introduction of fundamental issues on nonrepudiation, including the types of nonrepudiation service and cryptographic evidence, the roles of trusted third-party, nonrepudiation phases and requirements, and the status of standardization. Then it describes the general multiparty nonrepudiation problem, and analyzes state-of-the-art mechanisms. After this, it presents in more detail the 1-N multiparty nonrepudiation solutions for distribution of different messages to multiple recipients. Finally, it discusses advanced solutions for two typical multiparty nonrepudiation applications, namely, multiparty certified email and multiparty contract signing.
- Asokan, N. 1998. Fairness in electronic commerce. Ph.D. thesis, University of Waterloo, Department of Computer Science. Google Scholar
Digital Library
- Asokan, N., Baum-Waidner, B., Schunter, M., and Waidner, M. 1998. Optimistic synchronous multi-party contract signing. Tech. Rep. RZ 3089, IBM Zurich Research Lab.Google Scholar
- Asokan, N., Schunter, M., and Waidner, M. 1996. Optimistic protocols for multi-party fair exchange. Tech. Rep. RZ 2892 (no. 90840), IBM, Zurich Research Laboratory.Google Scholar
- Asokan, N., Schunter, M., and Waidner, M. 1997. Optimistic protocols for fair exchange. In Proceedings of the 4th ACM Conference on Computer and Communications Security. ACM Press, 7--17. Google ScholarDigital Library
- Asokan, N., Shoup, V., and Waidner, M. 2000. Optimistic fair exchange of digital signatures. IEEE J. Selected Areas Commun. 18, 4, 593--610.Google ScholarDigital Library
- Ateniese, G., de Medeiros, B., and Goodrich, M. T. 2001. TRICERT: A distributed certified e-mail scheme. In Proceedings of the Symposium on Network and Distributed System Security.Google Scholar
- Bao, F., Deng, R., and Mao, W. 1998. Efficient and practical fair exchange protocols with off-line ttp. In Proceedings of the IEEE Symposium on Security and Privacy. IEEE, 77--85.Google Scholar
- Bao, F., Deng, R., Nguyen, K., and Varadharajan, V. 1999. Multi-Party fair exchange with an off-line trusted neutral party. In Proceedings of the 10th International Workshop on Database and Expert Systems Applications. 858--862. Google ScholarDigital Library
- Baum-Waidner, B. 2001. Optimistic asynchronous multi-party contract signing with reduced number of rounds. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP). Springer, 898--911. Google ScholarDigital Library
- Baum-Waidner, B. and Waidner, M. 1998. Optimistic asynchronous multi-party contract signing. Tech. Rep. RZ 3078, IBM Zurich Research Lab.Google Scholar
- Baum-Waidner, B. and Waidner, M. 2000. Round-Optimal and abuse-free multi-party contract signing. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 1853. Springer, 524--535. Google ScholarDigital Library
- Blum, M. 1981. Three applications of the oblivious transfer: Part I: Coin flipping by telephone; part II: How to exchange secrets; part III: How to send certified electronic mail. Tech. Rep., Department of Electrical Engineering and Computer Science, University of California.Google Scholar
- Brannigan, C. 2004. Beyond e-commerce: Expanding the potential of online dispute resolution. Interact. 16, 4, 15--17.Google Scholar
- Chadha, R., Kremer, S., and Scedrov, A. 2004. Formal analysis of multi-party contract signing. In Proceedings of the 17th IEEE Computer Security Foundations Workshop (CSFW). IEEE Computer Society Press, 266--279. Google ScholarDigital Library
- Chiou, G. and Chen, W. 1989. Secure broadcasting using the secure lock. IEEE Trans. Softw. Eng. 15, 8 (Aug.), 929--934. Google ScholarDigital Library
- DeMillo, R. A. and Merritt, M. 1983. Protocols for data security. IEEE Comput. 16, 39--50. Google ScholarDigital Library
- Even, S., Goldreich, O., and Lempel, A. 1985. A randomized protocol for signing contracts. In Commun. ACM 28, 637--647. Google ScholarDigital Library
- Ferrer-Gomila, J. L., Payeras-Capellà, M., and Huguet-Rotger, L. 2001. Efficient optimistic n-party contract signing protocol. In Proceedings of the 4th International Conference on Information Security. Springer, 394--407. Google ScholarDigital Library
- Ferrer-Gomila, J. L., Payeras-Capellà, M., and Huguet-Rotger, L. 2002. A realistic protocol for multi-party certified electronic mail. In Proceedings of the Conference on Information Security (ISC). Lecture Notes in Computer Science, vol. 2433. Springer, 210--219. Google ScholarDigital Library
- Ferrer-Gomila, J. L., Payeras-Capellà, M., and Huguet-Rotger, L. 2004. Optimality in asynchronous contract signing protocols. In Proceedings of the 1st International Conference on Trust and Privacy in Digital Business, vol. 3184. Springer, 200--208.Google Scholar
- Franklin, M. and Tsudik, G. 1998. Secure group barter: Multi-Party fair exchange with semi-trusted neutral parties. In Proceedings of the Conference on Financial Cryptography. Lecture Notes in Computer Science, vol. 1465. Springer, 90--102. Google ScholarDigital Library
- Garay, J. A. and MacKenzie, P. D. 1999. Abuse-Free multi-party contract signing. In Proceedings of the 13th International Symposium on Distributed Computing. Springer, 151--165. Google ScholarDigital Library
- González-Deleito, N. 2005. Trust reletionships in exchange protocols. Ph.D. thesis, Faculté des Sciences, Université Libre de Bruselles.Google Scholar
- González-Deleito, N. and Markowitch, O. 2001. An optimistic multi-party fair exchange protocol with reduced trust requirements. In Proceedings of the 4th International Conference on Information Security and Cryptology. Lecture Notes in Computer Science, vol. 2288. Springer, 258--267. Google ScholarDigital Library
- González-Deleito, N. and Markowitch, O. 2002. Exclusion-Freeness in multi-party exchange protocols. In Proceedings of the 5th International Conference on Information Security (ISC). Lecture Notes in Computer Sciences, Springer, 200--209. Google ScholarDigital Library
- Gürgens, S. and Rudolph, C. 2002. Security analysis of (un-) fair non-repudiation protocols. In Formal Aspects of Security. Lecture Notes in Computer Science, vol. 2629. Spinger, 99--114.Google Scholar
- Gürgens, S., Rudolph, C., and Vogt, H. 2003. On the security of fair non-repudiation protocols. In Proceedings of the International Conference on Information Security (ITC). Lecture Notes in Computer Sciences, vol. 2851. Springer, 193--207.Google Scholar
- ISO/IEC. 1991. 1st WD 13888-2. non-repudiation Using a Symmetric Key Algorithm. JTC1/SC27/WG2 N83. ISO/IEC.Google Scholar
- ISO/IEC. 1996. DIS 10181-4. Information Technology—Open Systems Interconnection—Security Frameworks in Open Systems—Part 4: non-repudiation. ISO/IEC.Google Scholar
- ISO/IEC. 1997. 2nd CD 13888-3. Information Technology—Security Techniques—non-repudiation—Part 3: Using Asymmetric Techniques. JTC1/SC27 N1379. ISO/IEC.Google Scholar
- ISO/IEC. 1998. 3rd CD 13888-2. Information Technology—Security Techniques—non-repudiation—Part 2: Using Symmetric Encipherment Algorithms. JTC1/SC27 N1276. ISO/IEC.Google Scholar
- ISO/IEC. 2004. 13888-1. Information Technology—Security Techniques—non-repudiation—Part 1: General Model. JTC1/SC27. ISO/IEC.Google Scholar
- ITU-T X.509. 2000. Information Technology—Open Systems Interconnection—The Directory: Public-Key and Attribute Certificate Frameworks. ITU-T X.509.Google Scholar
- ITU-T X.813. 1996. Information Technology—Open Systems Interconnection—Security Frameworks for Open Systems: non-repudiation Framework. ITU-T X.813.Google Scholar
- Khill, I., Kim, J., Han, I., and Ryou, J. 2001. Multi-Party fair exchange protocol using ring architecture model. Comput. Secur. 20, 5, 422--439.Google ScholarDigital Library
- Kremer, S. and Markowitch, O. 2000a. A multi-party non-repudiation protocol. In Proceedings of the 15th International Conference on Information Security (SEC). IFIP World Computer Congress, 271--280. Google ScholarDigital Library
- Kremer, S. and Markowitch, O. 2000b. Optimistic non-repudiable information exchange. In Proceedings of the 21st Symposium on Information Theory in the Benelux, J. Biemond, ed. Werkgemeenschap Informatie-en Communicatietheorie, 139--146.Google Scholar
- Kremer, S., Markowitch, O., and Zhou, J. 2002. An intensive survey of fair non-repudiation protocols. Comput. Commun. 25, 17 (Nov.), 1606--1621.Google ScholarDigital Library
- Lindell, Y. 2003. Composition of Secure Multi-Party Protocols. Springer. Google ScholarDigital Library
- Markowitch, O., Gollmann, D., and Kremer, S. 2002. On fairness in exchange protocols. In Proceedings of the 5th International Conference on Information Security and Cryptology. Lecture Notes in Computer Science, vol. 2587. Springer, 451--464.Google Scholar
- Markowitch, O. and Kremer, S. 2000. A multi-party optimistic non-repudiation protocol. In Proceedings of 3rd International Conference on Information Security and Cryptology. Lecture Notes in Computer Science, vol. 2015. Springer, 109--122. Google ScholarDigital Library
- Markowitch, O. and Roggeman, Y. 1999. Probabilistic non-repudiation without trusted third party. In Proceedings of the 2nd Workshop on Security in Communication Networks.Google Scholar
- Markowitch, O. and Saeednia, S. 2001. Optimistic fair-exchange with transparent signature recovery. In Proceedings of the Conference on Financial Cryptography. Lecture Notes in Computer Science, vol. 2339. Springer, 339--350. Google ScholarDigital Library
- Maurer, U. 2004. New approaches to digital evidence. In Proc. IEEE. 92, IEEE, 933--947.Google ScholarCross Ref
- Micali, S. 2003. Simple and fast optimistic protocols for fair electronic exchange. In Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing (PODC). ACM Press, 12--19. Google ScholarDigital Library
- Mills, D. L. 1992. Network time protocol (version 3) specification, implementation and analysis. Tech. Rep. RFC 1305, IETF Working Group. Google ScholarDigital Library
- Onieva, J. A., Zhou, J., Carbonell, M., and Lopez, J. 2003. A multi-party non-repudiation protocol for exchange of different messages. In Proceedings of the 18th IFIP International Information Security Conference. Security and Privacy in the Age of Uncertainty. IFIP/Kluwer Academic Publishers, 37--48.Google Scholar
- Onieva, J. A., Zhou, J., and Lopez, J. 2004. Non-repudiation protocols for multiple entities. Comput. Commun. 27, 16, 1608--1616.Google ScholarDigital Library
- Pfitzmann, B., Schunter, M., and Waidner, M. 1998. Optimal efficiency of optimistic contract signing. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM Press, 113--122. Google ScholarDigital Library
- Shao, M.-H., Zhou, J., and Wang, G. 2005. On the security of a certified e-mail scheme with temporal authentication. In Proceedings of the ICCSA Workshop on Internet Communications Security. Lecture Notes in Computer Science, vol. 3482. Springer, 701--710.Google Scholar
- Zhou, J. 2001. Non-Repudiation in Electronic Commerce. Computer Security Series. Artech House. Google ScholarDigital Library
- Zhou, J. 2004. On the security of a multi-party certified email protocol. In Proceedings of the 6th International Conference on Information and Communications Security. Lecture Notes in Computer Science, vol. 3269, Springer, 40--52.Google Scholar
- Zhou, J. and Gollmann, D. 1996. A fair non-repudiation protocol. In Proceedings of the IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 55--61. Google ScholarDigital Library
- Zhou, J. and Gollmann, D. 1997. An efficient non-repudiation protocol. In Proceedings of the 10th Computer Security Foundations Workshop. IEEE Computer Society Press, 126--132. Google ScholarDigital Library
- Zhou, J., Onieva, J. A., and Lopez, J. 2005. Optimised multi-party certified email protocols. Inf. Manage. Comput. Secur. J. 13, 5, 350--366.Google ScholarCross Ref
- Zhou, J., Onieva, J. A., and Lopez, J. 2006. A synchronous multi-party contract signing protocol improving lower bound of steps. In Proceedings of the 21st IFIP International Information Security Conference Security and Privacy in Dynamic Environments. IFIP, vol. 201. Springer, 221--232.Google Scholar
Index Terms
- Multiparty nonrepudiation: A survey
Recommendations
Two-phase Nonrepudiation Protocols
ICCCNT '16: Proceedings of the 7th International Conference on Computing Communication and Networking TechnologiesA nonrepudiation protocol from party S to party R performs two tasks. First, the protocol enables party S to send to party R some text x along with a proof (that can convince a judge) that x was indeed sent by S. Second, the protocol enables party R to ...
Nonrepudiation Protocols in Cloud Systems
ICCCNT '16: Proceedings of the 7th International Conference on Computing Communication and Networking TechnologiesA nonrepudiation protocol from a sender S to a set of potential receivers {R1, R2, ..., Rn} performs two functions. First, this protocol enables S to send to every potential receiver Ri a copy of file F along with a proof that can convince an unbiased ...
Protocols for Multiparty Coin Toss with a Dishonest Majority
Coin-tossing protocols are protocols that generate a random bit with uniform distribution, although some corrupted parties might try to bias the output. These protocols are used as a building block in many cryptographic protocols. Cleve (Proc. of the ...
Comments