R. Ebrahimi Atani
[ 1 ] - EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
[ 2 ] - Improving Tor security against timing and traffic analysis attacks with fair randomization
The Tor network is probably one of the most popular online anonymity systems in the world. It has been built based on the volunteer relays from all around the world. It has a strong scientific basis which is structured very well to work in low latency mode that makes it suitable for tasks such as web browsing. Despite the advantages, the low latency also makes Tor insecure against timing and tr...
[ 3 ] - مروری بر حملات و پیاده سازی نرم افزاری الگوریتم‌های رمزنگاری توام با احراز اصالت مسابقه CAESAR
رمزنگاری احراز اصالتشده یک حالت اجرایی در رمزهای قطعهای بوده که خدمتهای احراز اصالت، محرمانگی و تمامیت داده را در فرآیند انتقال اطلاعات فراهم میکند. از سال 2014 مسابقهی تحت عنوان مسابقهی CAESAR آغاز شده است که هدف از این مسابقه رسیدن به طرحهای رمزنگاری احرازاصالتشده است که مزایای بیشتری نسبت به طرح AES-GCM ارائه دهند و برای استفاده گسترده مناسب باشند. در این مقاله، تمامی نامزدهای معرفی...
[ 4 ] - ارایه یک روش جدید انتشار داده‌ها با حفظ محرمانگی با هدف بهبود دقّت طبقه‌‌بندی روی داده‌های گمنام
Data collection and storage has been facilitated by the growth in electronic services, and has led to recording vast amounts of personal information in public and private organizations databases. These records often include sensitive personal information (such as income and diseases) and must be covered from others access. But in some cases, mining the data and extraction of knowledge from thes...
[ 5 ] - خوشه‌بندی فراابتکاری اسناد فارسی اِکس‌اِم‌اِل مبتنی بر شباهت ساختاری و محتوایی
Due to the increasing number of documents, XML, effectively organize these documents in order to retrieve useful information from them is essential. A possible solution is performed on the clustering of XML documents in order to discover knowledge. Clustering XML documents is a key issue of how to measure the similarity between XML documents. Conventional clustering of text documents using a do...
Co-Authors