5891 search results - page 247 / 1179 » On the Computational Security of a Distributed Key Distribut... |
147
click to vote
CCS
2007
ACM
15 years 10 months ago
2007
ACM
The problem of key management for access control systems has been well-studied, and the literature contains several schemes for hierarchy-based and temporal-based access control. ...
188
click to vote
CRYPTO
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
162
Voted
ASIACRYPT
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Semantic security against chosen-ciphertext attacks (INDCCA) is widely believed as the correct security level for public-key encryption scheme. On the other hand, it is o...
169
click to vote
EUROCRYPT
1998
Springer
15 years 11 months ago
1998
Springer
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...
199
click to vote
WMRD
1990
15 years 10 months ago
1990
This paper describes the design of an object replication scheme for the Arjuna distributed system. ThedesignsupportsK-resiliency,where,intheabsenceofnetworkpartitions,Koutofa tota...