Sciweavers

19 search results - page 1 / 4
» An Extremely Small and Efficient Identification Scheme
Sort
View
ACISP
2000
Springer
13 years 8 months ago
An Extremely Small and Efficient Identification Scheme
We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications. 1 Ove...
William D. Banks, Daniel Lieman, Igor Shparlinski
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
13 years 8 months ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski
INFOCOM
2010
IEEE
13 years 2 months ago
MIS: Malicious Nodes Identification Scheme in Network-Coding-Based Peer-to-Peer Streaming
Network coding has been shown to be capable of greatly improving quality of service in P2P live streaming systems (e.g., IPTV). However, network coding is vulnerable to pollution a...
Qiyan Wang, Long Vu, Klara Nahrstedt, Himanshu Khu...
ICIP
2004
IEEE
14 years 6 months ago
Efficient inscribing of noisy rectangular objects in scanned images
Objects identification in images is generally hard unless the objects are simple geometric shapes such as circles, rectangles or have very particular properties. Even simple geome...
Cormac Herley
EUROCRYPT
2004
Springer
13 years 8 months ago
Anonymous Identification in Ad Hoc Groups
We introduce Ad Hoc Anonymous Identification schemes, a new multi-user cryptographic primitive that allows participants from a user population to form ad hoc groups, and then prove...
Yevgeniy Dodis, Aggelos Kiayias, Antonio Nicolosi,...