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

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

2011
Nathaniel Wesley Filardo Giuseppe Ateniese

We exhibit a system for improving the quality of user-derived keying material on touchscreen devices. We allow a device to recover previously generated, highly entropic data suitable for use as (part of) a strong secret key from a user’s act of identifying to the device. Our system uses visual cryptography [22], using no additional electronics and no memorization on the part of the user. Instea...

Journal: :JSW 2011
Chengjie Gu Shunyi Zhang Yanfei Sun

Accurate network traffic identification plays important roles in many areas such as traffic engineering, QoS and intrusion detection etc. The emergence of many new encrypted applications which use dynamic port numbers and masquerading techniques causes the most challenging problem in network traffic identification field. One of the challenging issues for existing traffic identification methods ...

Journal: :IEICE Transactions on Information and Systems 2014

Journal: :IEICE Transactions 2013
Cheol-Ho Hong Chuck Yoo

In this paper, we propose a synchronization-aware VM scheduler for parallel applications in Xen. The proposed scheduler prevents threads from waiting for a significant amount of time during synchronization. For this purpose, we propose an identification scheme that can identify the threads that have awaited other threads for a long time. In this scheme, a detection module that can infer the int...

Journal: :IACR Cryptology ePrint Archive 2010
Charles Bouillaguet Jean-Charles Faugère Pierre-Alain Fouque Ludovic Perret

This paper presents a practical cryptanalysis of the Identification Scheme proposed by Patarin at Crypto 1996. This scheme relies on the hardness of the Isomorphism of Polynomial with One Secret (IP1S), and enjoys shorter key than many other schemes based on the hardness of a combinatorial problem (as opposed to numbertheoretic problems). Patarin proposed concrete parameters that have not been ...

2013
Stefan Berens Serge Fehr CWI Amsterdam Richard Gill Claude Elwood

The introduction of the Rényi entropy allowed a generalization of the Shannon entropy and unified its notion with that of other entropies. However, so far there is no generally accepted conditional version of the Rényi entropy corresponding to the one of the Shannon entropy. Different definitions proposed so far in the literature lacked central and natural properties one way or another. In this...

2013
Slim Bettaieb Julien Schrek

We present in this paper an improvement of the lattice-based threshold ring signature proposed by Cayrel, Lindner, Rückert and Silva (CLRS) [LATINCRYPT ’10]. We generalize the same identification scheme CLRS to obtain a more efficient threshold ring signature. The security of our scheme relies on standard lattice problems. The improvement is a significant reduction of the size of the signature....

Journal: :IEEE Trans. Contr. Sys. Techn. 2002
Jingang Yi Luis Mejías Alvarez Roberto Horowitz

In this paper, a control scheme for emergency braking maneuvers in automated highway systems (AHSs) and a new online identification scheme to determine the tire–road friction characteristics of the vehicle are presented. The proposed controller determines the required pressure in the master cylinder of the braking system to achieve maximum deceleration during braking, based on the estimation of...

Journal: :J. Braz. Comp. Soc. 1998
Francisco Vilar Brasileiro Tércio E. de Albuquerque Fonsêca Raquel Meneses da Costa

One of the main problems faced by the users of the World Wide Web is that of a broken link in a hypertext, normally caused by the unavailability of a particular resource. The introduction of redundancy is the key mechanism to solve this problem. Unfortunately, the current infrastructure of the Web is based on a resource identification scheme that maps a resource identifier on a unique physical ...

Journal: :IACR Cryptology ePrint Archive 2007
Kazukuni Kobara Kirill Morozov Raphael Overbeck

We present two efficient protocols for two flavors of oblivious transfer (OT): the Rabin and 1-out-of-2 OT using the McEliece cryptosystem and Shamir’s zero-knowledge identification scheme based on permuted kernels. This is a step towards diversifying computational assumptions on which OT – the primitive of central importance – can be based. Although we obtain a weak version of Rabin OT (where ...

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

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