An Unconditional Anonymous Sign-Cryption Algorithm

Chaum D, Van Heyst E. Group signatures. In D. W. Davies, editor, Proc. of Eurocrypt’91,LNCS, Springer-Verlag, 1992, vol.547: 257-265.[2]Camenisch J, Stadler M. Efficient group signature schemes for large groups. In Advances in Cryptology-CRYPTO’97, LNCS, Springer-Verlag, 1997, vol.1296: 410-424.[3]Cramer R, Damgard I, Schoenmakers B. Proofs of partial knowledge and simplified design of witness hiding protocols. In Y. G. Desmedt, editor, CRYPTO’94, LNCS, Springer-Verlag, 1994,vol.839: 174-187.[4]Abe M, Ohkubo M, Suzuki K. 1-out-of-n signatures from a variety of keys. Asiacrypt’2002, LNCS,Berlin, Heidelberg, Springer-Verlag, 2002, vol.2501: 415-423.[5]Rivest R L, Shamir A, Tauman Y. How to leak a secret. In C. Boyd, editor, in Proc. of Asiacrypt’01, LNCS, Springer-Verlag, 2001, vol.2248: 552-565.[6]Bresson, Stern, Szydlo. Threshold ring signatures for ad-hoc groups. Cryptology’2002, LNCS,Berlin Heidelberg, Springer-Verlag, 2002, vol.2442: 465-480.[7]Fangguo Zhang, Kwangjo Kim. ID-Based blind signature and ring signature from pairings. Asiacrypt’2002, LNCS, Berlin Heidelberg Springer-Verla, 2002, vol.2501: 533-547.[8]Zheng Y. Digital signcryption or how to achieve cost(signature and encryption) ＜＜cost(signature)+cost(encryption). B. Kaliski(Ed), Advances in Cryptology, in Proceedings Crypto’97, LNCS, Springer-Verlag, 1997, vol.1294: 165-179.[9]Zheng Y. Signcryption and its application in efficient public key solutions, in Proc. of Information Security Workshop(ISW’97), LNCS, Springer-Verlag, 1998, vol.1396: 291-312.