Unconditionally Secure Anonymous Encryption and Group Authentication

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 multireceiver scheme. Then, we define and formalize group authentication code (GA-code), which is an unconditionally secure authentication code with anonymity...

• Type: Journal
• Year: 2006
• Where: CJ
• Authors: Goichiro Hanaoka, Junji Shikata, Yumiko Hanaoka, Hideki Imai
• Keywords: Asymmetric Encryption Scheme, CJ 2006, Encryption Scheme, Play Important Roles