Sciweavers

147 search results - page 2 / 30
» Robust Metering Schemes for General Access Structures
Sort
View
IJNSEC
2007
131views more  IJNSEC 2007»
13 years 5 months ago
An Asymmetric Cryptographic Key Assignment Scheme for Access Control in Tree Structural Hierarchies
In a hierarchical structure, a user in a security class has access to information items of another class if and only if the former class is a predecessor of latter. Based upon cry...
Debasis Giri, Parmeshwary Dayal Srivastava
CRYPTO
2010
Springer
195views Cryptology» more  CRYPTO 2010»
13 years 6 months ago
Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
This paper presents a fully secure functional encryption scheme for a wide class of relations, that are specified by non-monotone access structures combined with inner-product rel...
Tatsuaki Okamoto, Katsuyuki Takashima
EUROCRYPT
2000
Springer
13 years 9 months ago
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
Ronald Cramer, Ivan Damgård, Ueli M. Maurer
ISCA
2005
IEEE
87views Hardware» more  ISCA 2005»
13 years 11 months ago
A Robust Main-Memory Compression Scheme
Lossless data compression techniques can potentially free up more than 50% of the memory resources. However, previously proposed schemes suffer from high access costs. The propose...
Magnus Ekman, Per Stenström
TCC
2007
Springer
89views Cryptology» more  TCC 2007»
13 years 11 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...