Abstract
Anonymous channels or similar techniques that can achieve sender’s anonymity play important roles in many applications. However, they will be meaningless if cryptographic primitives containing his identity is carelessly used during the transmission.
The main contribution of this paper is to study the security primitives for the above problem. In this paper, we first define unconditionally secure asymmetric encryption scheme (USAE), which is an encryption scheme with unconditional security and is impossible for a receiver to deduce the identity of a sender from the encrypted message. We also investigate tight lower bounds on required memory sizes from an information theoretic viewpoint and show an optimal construction based on polynomials. We also show a construction based on combinatorial theory, a non-malleable scheme and a multi-receiver scheme. Then, we define and formalize group authentication code (GA-code), which is an unconditionally secure authentication code with anonymity like group signatures. In this scheme, any authenticated user will be able to generate and send an authenticated message while the receiver can verify the legitimacy of the message that it has been sent from a legitimate user but at the same time retains his anonymity. For GA-code, we show two concrete constructions.
The first author is supported by a Research Fellowship from Japan Society for the Promotion of Science (JSPS).
Chapter PDF
Similar content being viewed by others
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.
References
M. Abe, “Universally verifiable mix-net with verification work independent of the number of mix-servers,” Proc. of EUROCRYPT’98, LNCS 1403, Springer-Verlag, pp. 437–447, 1998.
M. Bellare, A. Desai, E. Jokipii and P. Rogaway, “A concrete security treatment of symmetric encryption,” Proc. of 38th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 394–403, 1997.
M. Bellare, A. Desai, D. Pointcheval and P. Rogaway, “Relations among notions of security for public-key encryption schemes,” Proc. of CRYPTO’98, LNCS 1462, Springer-Verlag, pp. 26–45, 1998.
M. Ben-Or, S. Goldwasser and A. Wigderson, “Completeness theorems for non-cryptographic fault-tolerant distributed computation,” Proc. of 20th ACM Symposium on the Theory of Computing (STOC), pp. 1–10, 1988.
R. Blom, “Non-public key distribution,” Proc. of CRYPTO’82, Plenum Press, pp. 231–236, 1983.
C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro and M. Yung, “Perfectly secure key distribution for dynamic conferences,” Proc. of CRYPTO’92, LNCS 740, Springer-Verlag, pp. 471–486, 1993.
C. Blundo, L. A. Frota Mattos and D.R. Stinson, “Trade-offs between communication and storage in unconditionally secure schemes for broadcast encryption and interactive key distribution,” Proc. of CRYPTO’96, LNCS 1109, Springer-Verlag, pp. 387–400, 1996.
J. Camenisch and M. Stadler, “Efficient group signature schemes for large groups,” Proc. of CRYPTO’97, LNCS 1294, Springer-Verlag, pp. 410–424, 1997.
D. Chaum, “Untraceable electronic mail, return address, and digital pseudonyms,” Communication of the ACM, 24, pp. 84–88, 1981.
D. Chaum, “The dining cryptographers problem: unconditional sender and recipient untraceability,” Journal of Cryptology, 1,1, pp. 65–75, 1987.
D. Chaum and E. van Heyst, “Group signatures,” Proc. of EUROCRYPT’91, LNCS 547, Springer-Verlag, pp. 257–265, 1991.
Y. Desmedt, Y. Frankel and M. Yung, “Multi-receiver/Multi-sender network security: efficient authenticated multicast/feedback,” Proc. of IEEE Infocom’92, pp. 2045–2054, 1992.
W. Diffie and M. E. Hellman, “New directions in cryptography,” IEEE Trans. on Inform. Theory, IT-22, pp. 644–654, 1976.
D. Dolev, C. Dwork and M. Naor, “Non-malleable cryptography,” Proc. of 23rd ACM Symposium on the Theory of Computing (STOC), pp. 542–552, 1991.
P. Erdös, P. Frankl and Z. Furedi, “Families of finite sets in which no sets is covered by the union of two others,” Journal of Combin. Theory Ser. A 33, pp. 158–166, 1982.
P. Erdös, P. Frankl and Z. Furedi, “Families of finite sets in which no sets is covered by the union of r others,” Israel Journal of Math., 51, pp. 79–89, 1985.
T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Trans. on Inform. Theory, IT-31,4, pp. 469–472, 1985.
E. N. Gilbert, F. J. MacWilliams and N. J. A. Sloane, “Codes which detect deception,” Bell System Technical Journal, 53, pp. 405–425, 1974.
G. Hanaoka, J. Shikata, Y. Zheng and H. Imai, “Unconditionally secure digital signature schemes admitting transferability,” Proc. of ASIACRYPT 2000, LNCS 1976, Springer-Verlag, pp. 130–142, 2000.
G. Hanaoka, J. Shikata, Y. Zheng and H. Imai, “Efficient and unconditionally secure digital signatures and a security analysis of a multireceiver authentication code,” Proc. of PKC 2002, LNCS 2274, Springer-Verlag, pp. 64–79, 2002.
K. Kurosawa, T. Yoshida, Y. Desmedt and M. Burmester, “Some bounds and a construction for secure broadcast encryption,” Proc. of ASIACRYPT’98, LNCS 1514, Springer-Verlag, pp. 420–433, 1998.
T. Matsumoto and H. Imai, “On the KEY PREDISTRIBUTION SYSTEM: a practical solution to the key distribution problem,” Proc. of CRYPTO’87, LNCS 293, Springer-Verlag, pp. 185–193, 1987.
R. Rivest, “Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer,” unpublished manuscript.
R. Rivest, A. Shamir and L. Adleman, “A method for obtaining digital signature and public-key cryptosystems,” Communication of the ACM, 21,2, pp. 120–126, 1978.
C. E. Shannon, “Communication theory of secrecy systems,” Bell System Technical Journal, vol. 28, pp. 656–715, 1949.
J. Shikata, G. Hanaoka, Y. Zheng and H. Imai, “Security notions for unconditionally secure signature schemes,” Proc. of EUROCRYPT 2002, LNCS 2332, Springer-Verlag, pp. 434–449, 2002.
G. J. Simmons, “Authentication theory/coding theory,” Proc. of CRYPTO’84, LNCS 196, Springer-Verlag, pp. 411–431, 1984.
G. J. Simmons, “Message authentication with arbitration of transmitter/receiver disputes,” Proc. of EUROCRYPT’87, Springer-Verlag, pp. 151–165, 1987.
D. R. Stinson, “On some methods for unconditionally secure key distribution and broadcast encryption,” Designs, Codes and Cryptography, 12, pp. 215–243, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hanaoka, G., Shikata, J., Hanaoka, Y., Imai, H. (2002). Unconditionally Secure Anonymous Encryption and Group Authentication. In: Zheng, Y. (eds) Advances in Cryptology — ASIACRYPT 2002. ASIACRYPT 2002. Lecture Notes in Computer Science, vol 2501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36178-2_5
Download citation
DOI: https://doi.org/10.1007/3-540-36178-2_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00171-3
Online ISBN: 978-3-540-36178-7
eBook Packages: Springer Book Archive