Sciweavers

1965 search results - page 50 / 393
» Information shared by many objects
Sort
View
TCC
2007
Springer
86views Cryptology» more  TCC 2007»
15 years 3 months ago
Weakly-Private Secret Sharing Schemes
Abstract. Secret-sharing schemes are an important tool in cryptography that is used in the construction of many secure protocols. However, the shares’ size in the best known secr...
Amos Beimel, Matthew K. Franklin
SPAA
1997
ACM
15 years 1 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...
ISCI
2002
130views more  ISCI 2002»
14 years 9 months ago
A study of object declustering strategies in parallel temporal object database systems
In a transaction-time temporal object database management system (TODBMS), updating an object creates a new version of the object, but the old version is still accessible. A TODBM...
Kjetil Nørvåg
CRYPTO
2012
Springer
268views Cryptology» more  CRYPTO 2012»
13 years 6 days ago
Secret Sharing Schemes for Very Dense Graphs
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
Amos Beimel, Oriol Farràs, Yuval Mintz
PAKDD
2009
ACM
103views Data Mining» more  PAKDD 2009»
15 years 4 months ago
Hot Item Detection in Uncertain Data
Abstract. An object o of a database D is called a hot item, if there is a sufficiently large population of other objects in D that are similar to o. In other words, hot items are ...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...