Abstract
We show how to visualize an oblivious transfer and a commitment scheme with a method similar to that used in a visual secret sharing scheme. We call them a visual oblivious transfer and a visual commitment scheme, respectively. Data are images printed on transparencies, and the operation for obtaining information is only overlaying each of the transparencies over each other. Hence, it is easy for non-expert users to execute them. The visual oblivious transfer and the visual commitment scheme proposed in this paper are based on the trusted initializer model.
Chapter PDF
Similar content being viewed by others
References
Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference. American Federation of Information Processing Societies Proceedings, vol. 48, pp. 313–317 (1979)
Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 27–35. Springer, Heidelberg (1990)
Brickell, E.F.: Some ideal secret sharing schemes. Journal of Combinatorial Mathematics and Combinatorial Computing 6, 105–113 (1989)
Blundo, C., Santis, A.D., Stinson, D.R., Vaccaro, U.: Graph decompositions and secret sharing schemes. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 1–24. Springer, Heidelberg (1993)
Cramer, R., Fehr, S.: Optimal black-box secret sharing over arbitrary abelian groups. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 272–287. Springer, Heidelberg (2002)
Shamir, A.: How to share a secret. Communications of the ACM 22, 612–613 (1979)
Bellare, M., Micali, S.: Non-interactive oblivious transfer and application. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 547–557. Springer, Heidelberg (1990)
Crépeau, C.: Efficient cryptographic protocols based on noisy channels. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 306–327. Springer, Heidelberg (1997)
Damgård, I., Kilian, J., Salvail, L.: On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 56–73. Springer, Heidelberg (1999)
Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Communications of the ACM 28, 637–647 (1985)
Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Report, Tech. Memo. TR-81, Aiken Computation Laboratory, Harvard University (1981)
Blum, M.: Coin flipping by telephone: A protocol for solving impossible problems. In: Advances in Cryptology - A Report on CRYPTO 1981, pp. 11–15 (1982)
Naor, M., Shamir, A.: Visual cryptography. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 1–12. Springer, Heidelberg (1995)
Rivest, R.L.: Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer (1999), http://theory.lcs.mit.edu/~/Rivest-commitment.pdf
Koga, H., Iwamoto, M., Yamamoto, H.: An analytic construction of the visual secret sharing scheme for color images. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E84-A, 262–272 (2001)
Crépeau, C.: Equivalence between two flavours of oblivious transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 350–368. Springer, Heidelberg (1988)
Blundo, C., Masucci, B., Stinson, D.R., Wei, R.: Constructions and bounds for unconditionally secure non-interactive commitment schemes. Designs, Codes and Cryptography 26, 97–110 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuwakado, H., Morii, M., Tanaka, H. (2005). Visual Cryptographic Protocols Using the Trusted Initializer. In: Qing, S., Mao, W., López, J., Wang, G. (eds) Information and Communications Security. ICICS 2005. Lecture Notes in Computer Science, vol 3783. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602897_10
Download citation
DOI: https://doi.org/10.1007/11602897_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30934-5
Online ISBN: 978-3-540-32099-9
eBook Packages: Computer ScienceComputer Science (R0)Springer Nature Proceedings Computer Science
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.