Sciweavers

47 search results - page 4 / 10
» On Constructing Homomorphic Encryption Schemes from Coding T...
Sort
View
PKC
2011
Springer
219views Cryptology» more  PKC 2011»
12 years 9 months ago
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
Dan Boneh, David Mandell Freeman
CORR
2010
Springer
179views Education» more  CORR 2010»
13 years 3 months ago
Algebraic Constructions of Graph-Based Nested Codes from Protographs
Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence ...
Christine A. Kelley, Jörg Kliewer
APPROX
2011
Springer
272views Algorithms» more  APPROX 2011»
12 years 6 months ago
Public Key Locally Decodable Codes with Short Keys
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
Brett Hemenway, Rafail Ostrovsky, Martin J. Straus...
STOC
2006
ACM
120views Algorithms» more  STOC 2006»
14 years 6 months ago
Black-box constructions for secure computation
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...
SISW
2005
IEEE
13 years 12 months ago
Lazy Revocation in Cryptographic File Systems
A crucial element of distributed cryptographic file systems are key management solutions that allow for flexible but secure data sharing. We consider efficient key management s...
Michael Backes, Christian Cachin, Alina Oprea