Sciweavers

9 search results - page 2 / 2
» Secure Computation with Sublinear Amortized Work
Sort
View
ICALP
2009
Springer
14 years 5 months ago
Dynamic Succinct Ordered Trees
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
Arash Farzan, J. Ian Munro
ASIACRYPT
2009
Springer
14 years 2 days ago
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, H...
RTCSA
2006
IEEE
13 years 11 months ago
Systematic Security and Timeliness Tradeoffs in Real-Time Embedded Systems
Real-time embedded systems are increasingly being networked. In distributed real-time embedded applications, e.g., electric grid management and command and control applications, i...
Kyoung-Don Kang, Sang Hyuk Son
EUROCRYPT
2006
Springer
13 years 9 months ago
Our Data, Ourselves: Privacy Via Distributed Noise Generation
In this work we provide efficient distributed protocols for generating shares of random noise, secure against malicious participants. The purpose of the noise generation is to crea...
Cynthia Dwork, Krishnaram Kenthapadi, Frank McSher...