Sciweavers

19 search results - page 2 / 4
» An Extremely Small and Efficient Identification Scheme
Sort
View
ICISC
2000
126views Cryptology» more  ICISC 2000»
13 years 6 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...
EUROCRYPT
1995
Springer
13 years 8 months ago
Quantum Oblivious Mutual Identification
We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and e...
Claude Crépeau, Louis Salvail
BMCBI
2007
149views more  BMCBI 2007»
13 years 4 months ago
SAMPI: Protein Identification with Mass Spectra Alignments
Background: Mass spectrometry based peptide mass fingerprints (PMFs) offer a fast, efficient, and robust method for protein identification. A protein is digested (usually by tryps...
Hans-Michael Kaltenbach, Andreas Wilke, Sebastian ...
ICDCS
2010
IEEE
13 years 6 months ago
ASAP: Scalable Identification and Counting for Contactless RFID Systems
The growing importance of operations such as identification, location sensing and object tracking has led to increasing interests in contactless Radio Frequency Identification (RFI...
Chen Qian, Yunhuai Liu, Hoilun Ngan, Lionel M. Ni
CCS
2007
ACM
13 years 8 months ago
Highly efficient techniques for network forensics
Given a history of packet transmissions and an excerpt of a possible packet payload, the payload attribution problem requires the identification of sources, destinations and the t...
Miroslav Ponec, Paul Giura, Hervé Brön...