Sciweavers

977 search results - page 99 / 196
» Secure Computation with Fixed-Point Numbers
Sort
View
IACR
2011
212views more  IACR 2011»
12 years 8 months ago
Fully Homomorphic Encryption without Bootstrapping
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual con...
Zvika Brakerski, Craig Gentry, Vinod Vaikuntanatha...
INFOCOM
2008
IEEE
14 years 3 months ago
Lightweight and Compromise-Resilient Message Authentication in Sensor Networks
Abstract—Numerous authentication schemes have been proposed in the past for protecting communication authenticity and integrity in wireless sensor networks. Most of them however ...
Wensheng Zhang, Nalin Subramanian, Guiling Wang
DAC
1999
ACM
14 years 10 months ago
Robust FPGA Intellectual Property Protection Through Multiple Small Watermarks
A number of researchers have proposed using digital marks to provide ownership identification for intellectual property. Many of these techniques share three specific weaknesses: ...
John Lach, William H. Mangione-Smith, Miodrag Potk...
PKC
2009
Springer
115views Cryptology» more  PKC 2009»
14 years 9 months ago
Compact CCA-Secure Encryption for Messages of Arbitrary Length
This paper proposes a chosen-ciphertext secure variant of the ElGamal public-key encryption scheme which generates very compact ciphertexts for messages of arbitrary length. The ci...
Masayuki Abe, Eike Kiltz, Tatsuaki Okamoto
IEEEARES
2008
IEEE
14 years 3 months ago
Finding Evidence of Antedating in Digital Investigations
— Finding evidence of antedating is an important goal in many digital investigations. This paper explores how causality can expose antedating by investigating storage systems for...
Svein Yngvar Willassen