Sciweavers

35 search results - page 6 / 7
» pkc 2010
Sort
View
PKC
2010
Springer
126views Cryptology» more  PKC 2010»
13 years 8 months ago
Implicit Factoring with Shared Most Significant and Middle Bits
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...
Jean-Charles Faugère, Raphaël Marinier...
MASS
2010
156views Communications» more  MASS 2010»
13 years 4 months ago
On application of Host Identity Protocol in wireless sensor networks
Recent advances in development of low-cost wireless sensor platforms open up opportunities for novel wireless sensor network (WSN) applications. Likewise emerge security concerns o...
Andrey Khurri, Dmitriy Kuptsov, Andrei Gurtov
PKC
2012
Springer
234views Cryptology» more  PKC 2012»
11 years 8 months ago
Ring-LWE in Polynomial Rings
Abstract. The Ring-LWE problem, introduced by Lyubashevsky, Peikert, and Regev (Eurocrypt 2010), has been steadily finding many uses in numerous cryptographic applications. Still,...
Léo Ducas, Alain Durmus
IACR
2011
113views more  IACR 2011»
12 years 5 months ago
Fully Homomorphic SIMD Operations
At PKC 2010 Smart and Vercauteren presented a variant of Gentry’s fully homomorphic public key encryption scheme and mentioned that the scheme could support SIMD style operations...
Nigel P. Smart, Frederik Vercauteren
AFRICACRYPT
2010
Springer
13 years 9 months ago
Efficient Unidirectional Proxy Re-Encryption
Abstract. Proxy re-encryption (PRE) allows a semi-trusted proxy to convert a ciphertext originally intended for Alice into one encrypting the same plaintext for Bob. The proxy only...
Sherman S. M. Chow, Jian Weng, Yanjiang Yang, Robe...