XABARLARNI XAVFSIZ UZATISH UCHUN YANGI K-ANONIM PROTOKOLINI ISHLAB CHIQISH
Keywords:
Anonimlik, k-anonim, Dining-Cryptographer, guruh indekslari, a’zolar indekslari, xabar maydoni.Abstract
Ushbu tadqiqot ishida yangi k-anonim uzatish protokolini taklif etamiz. Protokol assimetrik shifrlash algoritmiga asoslangan. Protokolning barcha a’zolari kichikroq guruhlarga bo‘linadi va agar guruhdagi barcha a’zolar protokolni to‘g‘ri bajarsa, protokol jo‘natuvchi k - anonim va qabul qiluvchi k - anonim hisoblanadi. Tadqiqotimizning maqsadi Internetda foydalanuvchilarning anonimligini himoya qilishdir. Bu yerda ikkita muhim masalani tahlil qilingan: samaradorlik va xavfsizlik, taklif qilingan protokolni baholash.
References
L. von Ahn, A. Bortz and N. J. Hopper. “k-Anonymous Message Transmission”. the 10th ACM Conference on Computer and Communication Security. pages 122-130, 2003.
D. Chaum. “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms”. Communications of the ACM. 24(2), pages 84-88, 1981.
D. Chaum. “The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability”. Journal of Cryptology. 1(1), pages 65-75, 1988.
Gang Yao and Dengguo Feng, “A New k-Anonymous Message Transmission Protocol”. WISA 2004, LNCS 3325, pp. 388–399, 2004.
D. Denning, P. Denning, and M. Schwartz. “The tracker: A threat to statistical database security”. ACM Trans. on Database Systems. 4(1), pages 76-96, 1979.
