Sciweavers

ICITS
2009
13 years 1 months ago
Linear Threshold Multisecret Sharing Schemes
In a multisecret sharing scheme, several secret values are distributed among a set of n users, and each secret may have a different associated access structure. We consider here un...
Oriol Farràs, Ignacio Gracia, Sebasti&agrav...
DAM
2006
102views more  DAM 2006»
13 years 3 months ago
Secret sharing schemes on access structures with intersection number equal to one
The characterization of ideal access structures and the search for bounds on the optimal information rate are two important problems in secret sharing. These problems are studied ...
Jaume Martí-Farré, Carles Padr&oacut...
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
13 years 7 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
EUROCRYPT
1998
Springer
13 years 7 months ago
Quorum-Based Secure Multi-party Computation
Abstract. This paper describes e cient protocols for multi-party computations that are information-theoretically secure against passive attacks. The results presented here apply to...
Donald Beaver, Avishai Wool
VLDB
1999
ACM
89views Database» more  VLDB 1999»
13 years 7 months ago
Physical Data Independence, Constraints, and Optimization with Universal Plans
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...
Alin Deutsch, Lucian Popa, Val Tannen
LAWEB
2003
IEEE
13 years 9 months ago
Application Modeling for the Semantic Web
In this article we present a method for the design and implementation of Web Applications for the Semantic Web. Based on the "Object Oriented Hypermedia Design Method" a...
Fernanda Lima, Daniel Schwabe
AINA
2005
IEEE
13 years 9 months ago
Dynamic Key Generations for Secret Sharing in Access Structures
In a secret sharing scheme based upon access structures, each group has an authorization and only the participants who stayed in an authorized access structure can recover the sec...
Chu-Hsing Lin, Wei Lee, Chien-Sheng Chen
TCC
2007
Springer
89views Cryptology» more  TCC 2007»
13 years 9 months ago
On Secret Sharing Schemes, Matroids and Polymatroids
Abstract. One of the main open problems in secret sharing is the characterization of the access structures of ideal secret sharing schemes. As a consequence of the results by Brick...
Jaume Martí-Farré, Carles Padr&oacut...
CCS
2007
ACM
13 years 9 months ago
Provably secure ciphertext policy ABE
In ciphertext policy attribute-based encryption (CP-ABE), every secret key is associated with a set of attributes, and every ciphertext is associated with an access structure on a...
Ling Cheung, Calvin C. Newport