Sciweavers

35 search results - page 2 / 7
» pkc 2010
Sort
View
PKC
2010
Springer
130views Cryptology» more  PKC 2010»
13 years 9 months ago
Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
Abstract. This paper describes an extremely efficient squaring operation in the so-called ‘cyclotomic subgroup’ of F× q6 , for q ≡ 1 mod 6. This result arises from consideri...
Robert Granger, Michael Scott
PKC
2010
Springer
119views Cryptology» more  PKC 2010»
13 years 7 months ago
Efficient Set Operations in the Presence of Malicious Adversaries
We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main...
Carmit Hazay, Kobbi Nissim
PKC
2010
Springer
161views Cryptology» more  PKC 2010»
13 years 7 months ago
Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
ded abstract of this paper appears in 13th International Conference on Practice and Theory in Public Key Cryptography (PKC) 2010, Lecture Notes in Computer Science Vol. ?, P. Nguye...
Kristiyan Haralambiev, Tibor Jager, Eike Kiltz, Vi...
PKC
2010
Springer
217views Cryptology» more  PKC 2010»
13 years 9 months ago
Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions
Lossy Trapdoor Functions (LTDFs), introduced by Peikert and Waters (STOC 2008) have been useful for building many cryptographic primitives. In particular, by using an LTDF that los...
Petros Mol, Scott Yilek
PKC
2010
Springer
193views Cryptology» more  PKC 2010»
13 years 9 months ago
Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
We present a fully homomorphic encryption scheme which has both relatively small key and ciphertext size. Our construction follows that of Gentry by producing a fully homomorphic s...
Nigel P. Smart, Frederik Vercauteren