Sciweavers

146 search results - page 19 / 30
» Homomorphic encryption from codes
Sort
View
FC
2007
Springer
105views Cryptology» more  FC 2007»
13 years 11 months ago
Space-Efficient Private Search with Applications to Rateless Codes
Abstract. Private keyword search is a technique that allows for searching and retrieving documents matching certain keywords without revealing the search criteria. We improve the s...
George Danezis, Claudia Díaz
SIAMCOMP
2011
13 years 2 months ago
Black-Box Constructions of Protocols for Secure Computation
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...
Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yeh...
FASE
2008
Springer
13 years 9 months ago
Language-Based Optimisation of Sensor-Driven Distributed Computing Applications
In many distributed computing paradigms, especially sensor networks and ubiquitous computing but also grid computing and web services, programmers commonly tie their application to...
Jonathan J. Davies, Alastair R. Beresford, Alan My...
ICN
2001
Springer
14 years 1 days ago
Secure Communication: A New Application for Active Networks
SplitPath is a new application for the easy, well-known and provably secure one-time pad encryption scheme. Two problems hinder the one-time pad scheme from being applied in the ar...
Manuel Günter, Marc Brogle, Torsten Braun
ISW
2009
Springer
14 years 2 months ago
Towards Security Notions for White-Box Cryptography
Abstract. While code obfuscation attempts to hide certain characteristics of a program independently of an application, white-box cryptography (WBC) specifically focuses on softwa...
Amitabh Saxena, Brecht Wyseur, Bart Preneel