由於資訊技術的發展及電腦的普及化，網際網路中的各式應用為人類帶來了極大的便利性，然而，網路中的各種威脅郤也在悄悄的展開中。有鑑於網路中潛在的風險，現代密碼學家研究各式密碼技術，以解決開放性的網路環境中，可能遭受的威脅。

　　在網路電子會議中，會議金鑰可保有通訊內容之私密，使得會議成員不必擔心會議內容遭人竊聽。匿名式電子會議的技術，則可使一群互相不知道身份的網路使用者，在網路中進行會議。本論文將針對匿名式電子會議，提出一套完整的匿名分類方式，方便使用者根據不同的匿名需求及環境，選擇最適當的匿名種類。

　　此外，為了使現有之會議金鑰技術，同樣能夠擴展至匿名分類中的各項匿名種類，本論文中也有描述其擴展之限制，以及擴展時作法上之概念及實例。

[1] William Stallings, Network And Internetwork Security Principles And Practice, Prentice Hall International Edition, pp.1-14, 1995.
[2] NBS FIPSPUB 46, “Data Encryption Standard,” National Bureau of Standards, U.S. Department of Commerce, Jan 1977.
[3] X. Lai, and J. Massey, “A Proposal for a New Block Encryption Standard,” Advances in Cryptology-EUROCRYPT’90, Springer-Verlag, LNCS 473, pp.389-404, 1991.
[4] National Institute of Standards and Technology, “The Advanced Encryption Standard,” http://csrc.nist.gov/aes/, 2000.
[5] R. Rivest, A. Shamir, and L. Adleman, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Communications of the ACM, Vol.21, No.2, pp.120-126, Feb 1978.
[6] T. ElGamal, “A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms,” Advances in Cryptology-CRYPTO’84, Springer-Verlag, LNCS 196, pp.10-18, 1985.
[7] R. Rivest, “The MD5 Message Digest Algorithm,” RFC 1321, Apr 1992.
[8] NIST FIPS PUB 180-1, “Secure Hash Standard”, National Institute of Standards and Technology, U.S. Department of Commerce, Apr 1995.
[9] I. Ingemarsson, D. Tang, and C. Wong, “A Conference Key Distribution System,” IEEE Transactions on Information Theory, Vol.28, No.5, pp.714-720, Sep 1982.
[10] C. C. Chang, and C. H. Lin, “How to Converse Securely in a Conference,” Proc. IEEE 30th Ann. International Carmaban Conference, pp.42-45, 1996.
[11] C. C. Chang, T. C. Wu, and C. P. Chen, “The Design of a Conference Key Distribution System,” Proc. Advances in Cryptology-ASIACRYPT’92, pp.459-466, 1992.
[12] K. Koyama, and K. Ohta, “Identity-Based Conference Key Distribution Scheme,” Proc. Advances in Cryptology-CRYPTO’87, pp.175-184, 1988.
[13] K. Koyama, “Secure Conference Key Distribution Scheme for Conspiracy Attack,” Proc. Advances in Cryptology-EUROCRYPT’92, pp.449-453, 1993.
[14] W. G. Tzeng, and Z. J. Tzeng, “Round-Efficient Conference Key Agreement Protocols with Provable,” In Advances in Cryptology-ASIACRYPT’2000. Lecture Notes in Computer Science. Springer-Verlag, Kyoto, Japan.
[15] E. Bresson, O. Chevassut, D. Pointcheval, and J. J. Quisquater, “Provably authenticated group Diffie-Hellman key exchange,” Proc. 8th Annual ACM Conference on Computer and Communications Security, ACM, pp.255-264, 2001.
[16] W. G. Tzeng, “A Secure Fault-Tolerant Conference-Key Agreement Protocol,” IEEE Transactions on Computers, Vol.51, No.4, pp.373-379, 2002.
[17] C. Boyd, and J. M. G. Nieto, “Round-Optimal Contributory Conference Key Agreement,” Public-Key Cryptography, LNCS vol.2567, pp.161-174, 2003.
[18] J. Nam, J. Lee, S. Kim, and D. Won “DDH-Based Group Key Agreement in A Mobile Environment," The Journal of Systems and Software Article In Press 2004.
[19] Xun Yi, “Identity Based Fault Tolerant Conference Key Agreement,” IEEE Transactions on Dependable and Secure Computing Vol.1, No.3, pp.170-178, 2004.
[20] Y. Amir, Y. Kim, C. Nita-Rotaru, J. Schultz, J. Stanton, and G. Tsudik, “Secure Group Communication Using Robust Contributory Key Agreement,” IEEE Trans. Parallel and Distrib. Syst. Vol.15, No.5, pp.468–480, 2004.
[21] M. S. Hwang, and W. P. Yang, “Conference Key Distribution Schemes for Secure Digital Mobile Communications,” IEEE Journal on Selected Areas in Communications Vol.13, No.2, pp.416-420, 1995.
[22] C. C. Chang, P. C. Huang, and W. B. Lee, “Conference Key Distribution Schemes for Portable Communication Systems,” Computer Communications 22 pp.1160-1164, 1999.
[23] S. J. Wang, “Anonymous Wireless Authentication on a Portable Cellular Mobile System,” IEEE Transactions on Computers Vol.53, No.10, pp.1317-1329, 2004.
[24] T. C. Wu, “Conference Key Distribution System with User Anonymity Based on Algebraic Approach, ”IEE Proc.-Comput. Digit. Tech., Vol.144, No.2, 1997.
[25] Y. M. Tseng, and J. K. Jan, “Anonymous Conference Key Distribution Systems Based on The Discrete Logarithm Problem,”Computer Communications 22 749-754, 1999.
[26] MaoJane, Yangbo, “Anonymous and Dynamic Conference-Key Distribution System,” IEEE International Symposlum on Personal, Indoor and Mobile Radio Communication Proceedings, pp.2784-2788, 2003.
[27] C. K. Wong, M. G. Gouda, and S. S. Lam, “Secure Group Communications Using Key Graphs,” IEEE/ACM Trans. Netw. Vol.8, No.1, pp.16-30, 2000.
[28] Y. Kim, A. Perrig, and G. Tsudik, “Tree-based Group Key Agreement,” ACM Transactions on Information and System Security, Vol.7, No.1, pp.60-96, 2004.
[29] Y. Amir, Y. Kim, C. Nita-Rotaru, and G. Tsudik, “On the Performance of Group Key Agreement Protocols,” ACM Transactions on Information and System Security, Vol.7, No.3, pp.457-488, 2004.
[30] M. Steiner, and G. Tsudik, “Key Agreement in Dynamic Peer Groups,” IEEE Transactions on Parallel and Distributed Systems, Vol.11, No.8, 2000.
[31] Y. Kim, A. Perrig, and G. Tsudik, “Group Key Agreement Efficient in Communication,” IEEE Transactions on Computers, Vol.53, No.7, pp.905-921, 2004.
[32] M. Steiner, G. Tsudik, and M. Waidner, “Diffie-Hellman Key Distribution Extended to Groups,” Third ACM Conf. Computer and Comm. Security, pp.31-37, Mar 1996.
[33] J. Herranz, and G. Sáez, “Forking Lemmas for Ring Signature Schemes,” INDOCRYPT’03, pp.266-279, 2003.