Sciweavers

94 search results - page 14 / 19
» New lattice based cryptographic constructions
Sort
View
ASIACRYPT
2009
Springer
14 years 3 months ago
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, H...
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
11 years 11 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha
WEA
2005
Springer
109views Algorithms» more  WEA 2005»
14 years 2 months ago
Synchronization Fault Cryptanalysis for Breaking A5/1
Abstract. A5/1 pseudo-random bit generator, known from GSM networks, potentially might be used for different purposes, such as secret hiding during cryptographic hardware testing, ...
Marcin Gomulkiewicz, Miroslaw Kutylowski, Heinrich...
CTRSA
2012
Springer
285views Cryptology» more  CTRSA 2012»
12 years 4 months ago
Plaintext-Checkable Encryption
We study the problem of searching on encrypted data, where the search is performed using a plaintext message or a keyword, rather than a message-specific trapdoor as done by state...
Sébastien Canard, Georg Fuchsbauer, Aline G...
JCP
2008
216views more  JCP 2008»
13 years 8 months ago
Direct Anonymous Attestation for Next Generation TPM
Trusted computing platforms have been proposed as a promising approach to enhance the security of general-purpose computing systems. Direct Anonymous Attestation(DAA) is a scheme t...
Xiaofeng Chen 0004, Dengguo Feng