Sciweavers

31 search results - page 5 / 7
» Binary Tree Encryption: Constructions and Applications
Sort
View
IACR
2011
127views more  IACR 2011»
12 years 7 months ago
Oblivious RAM with O((log N)^3) Worst-Case Cost
Oblivious RAM (O-RAM) is a useful primitive that allows a client to hide its data access patterns from an untrusted server in storage outsourcing applications. This paper proposes...
Elaine Shi, T.-H. Hubert Chan, Emil Stefanov, Ming...
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 2 months ago
Physical expander in Virtual Tree Overlay
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...
Taisuke Izumi, Maria Potop-Butucaru, Mathieu Valer...
TIT
1998
127views more  TIT 1998»
13 years 7 months ago
On a New Class of Codes for Identifying Vertices in Graphs
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
Mark G. Karpovsky, Krishnendu Chakrabarty, Lev B. ...
ICSE
2010
IEEE-ACM
14 years 8 days ago
Adaptive bug isolation
Statistical debugging uses lightweight instrumentation and statistical models to identify program behaviors that are strongly predictive of failure. However, most software is most...
Piramanayagam Arumuga Nainar, Ben Liblit
PODC
2009
ACM
14 years 8 months ago
Max registers, counters, and monotone circuits
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...
James Aspnes, Hagit Attiya, Keren Censor