Sciweavers

849 search results - page 16 / 170
» Completely Non-malleable Schemes
Sort
View
ICCAD
1996
IEEE
102views Hardware» more  ICCAD 1996»
13 years 12 months ago
Bit-flipping BIST
A scan-based BIST scheme is presented which guarantees complete fault coverage with very low hardware overhead. A probabilistic analysis shows that the output of an LFSR which fee...
Hans-Joachim Wunderlich, Gundolf Kiefer
CGF
2007
98views more  CGF 2007»
13 years 7 months ago
Distance-Ranked Connectivity Compression of Triangle Meshes
We present a new, single-rate method for compressing the connectivity information of a connected 2-manifold triangle mesh with or without boundary. Traditional compression schemes...
Patrick Marais, James E. Gain, D. Shreiner
AINA
2010
IEEE
14 years 25 days ago
Against Spyware Using CAPTCHA in Graphical Password Scheme
—Text-based password schemes have inherent security and usability problems, leading to the development of graphical password schemes. However, most of these alternate schemes are...
Liming Wang, Xiuling Chang, Zhongjie Ren, Haichang...
CORR
2010
Springer
212views Education» more  CORR 2010»
13 years 7 months ago
Cryptanalysis of a more efficient and secure dynamic id-based remote user authentication scheme
In 2004, Das, Saxena and Gulati proposed a dynamic ID-based remote user authentication scheme which has many advantage such as no verifier table, user freedom to choose and change...
Mohammed Aijaz Ahmed, D. Rajya Lakshmi, Sayed Abdu...
ICCS
2009
Springer
14 years 2 months ago
A Scalable Non-blocking Multicast Scheme for Distributed DAG Scheduling
Abstract. This paper presents an application-level non-blocking multicast scheme for dynamic DAG scheduling on large-scale distributedmemory systems. The multicast scheme takes int...
Fengguang Song, Jack Dongarra, Shirley Moore