نتایج جستجو برای: identification key

تعداد نتایج: 936593  

Journal: :IACR Cryptology ePrint Archive 2009
Koji Nuida

A collusion-secure code is called robust if it is secure against erasure of a limited number of undetectable bits, in addition to collusion attacks under Marking Assumption. In this article, we propose the first general conversion method of (non-robust) c-secure codes to robust c-secure codes. Also, the same method amplifies robustness of given robust c-secure codes. By applying our conversion ...

2008
M. Usman Akram Rabia Arshad Rabia Anwar Shoab Ahmad Khan Sarwat Nasir

Performance of Automatic Fingerprint Identification System( AFIS) is greatly influenced by the detection of core point. Extraction of best Region Of Interest(ROI) from image can play a vital role for core point detection. In this paper, we present an improved technique for fine orientation field estimation and core point detection. The distinct feature of our technique is that it gives high det...

Journal: :IACR Cryptology ePrint Archive 2006
Gene Tsudik

Security and privacy in RFID systems is an important and active research area. A number of challenges arise due to the extremely limited computational, storage and communication abilities of a typical RFID tag. This paper describes a step-by-step construction of a family of simple protocols for inexpensive untraceable identification and authentication of RFID tags. This work is aimed primarily ...

Journal: :I. J. Network Security 2005
Cheng-Chi Lee

In 2000, Lee and Chang proposed a user identification scheme with key distribution preserving anonymity for distributed computer networks. Recently, Wu and Hsu pointed out that there are two weaknesses in the LeeChang scheme. They further not only proposed a new scheme to remedy the security leaks of the Lee-Chang scheme, but also reduced computation complexities and communication cost as compa...

Journal: :J. Network and Computer Applications 2011
Roberto Di Pietro Refik Molva

In this paper, we provide the following contributions to enhance the security of RFID based systems. First, we assume that among multiple servers storing the information related to the tags some of them can be compromised. For this new threat scenario, we devise a technique to make RFID identification server dependent, providing a different unique secret key shared by a tag and a server. The so...

Journal: :IACR Cryptology ePrint Archive 2012
Shao-hui Wang Sujuan Liu Dan-wei Chen

Privacy of RFID systems is receiving increasing attentions in the RFID community and an important issue required as to the security of RFID system. Backward privacy means the adversary can not trace the tag later even if he reveals the internal states of the tag sometimes before. In this paper, we analyze two recently proposed RFID authentication schemes: Randomized GPS and Randomized Hashed GP...

2014
Zahra Jeddi Esmaeil Amini Magdy Bayoumi

In this paper, we present RBS (Redundant Bit Security) algorithm which is a low-complexity symmetric encryption with a 132-bit secret key. In this algorithm redundant bits are distributed among plaintext data bits to change the location of the plaintext bits in the transmitted data without changing their order. The location of redundant bits inside the transmitted data represents the secret key...

2001
Seongsoo Park Mun - Kyu Lee Dong Kyue Kim Kunsoo Park Yousung Kang Sokjoon Lee Howon Kim Kyoil Chung

Electronic seal is an electronic device to check the authenticity and integrity of freight containers at the point of arrival. While RFID-based eSeals are gaining more acceptances and there are also some standardization processes for these devices, a recent research revealed that the current RFID-based eSeals are vulnerable to various attacks. In this paper, we provide a feasible solution to en...

2004
Marc Girault David Lefranc

We focus on the GPS identification scheme implementation in low cost chips, i.e not equipped with a microprocessor (such as those embedded in some prepaid telephone cards or RFID tags). We present three solutions to decrease the overall number of manipulated bits during the computation of the answer by a factor two or three. All the solutions stand in the use of low Hamming weight parameters. T...

ژورنال: The Iranian Journal of Botany 2017

جنس .Paeonia L تنها جنس تیره Paeoniaceae است که حدود 40 گونه در دنیا دارد و اغلب جزو عناصر اروپائی آسیائی محسوب می‌گردند. تعداد گونه‌های آن در ایران در منابع مختلف متفاوت و نامهای متفاوتی نیز برای آنها بکار برده شده است. تاکسونومی جنس در ایران مورد بررسی قرار گرفت. در این رابطه نمونه‌های هرباریومهای معتبر و در دسترس ایران مورد بررسی و بازبینی قرار گرفت و با مطالعات صحرائی تکمیل یافت. تصاویر نمو...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید