860 search results - page 96 / 172 » Completeness in two-party secure computation: a computationa... |
178
click to vote
TPDS
1998
15 years 5 months ago
1998
—We suggest a method of controlling the access to a secure database via quorum systems. A quorum system is a collection of sets (quorums) every two of which have a nonempty inter...
301
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
150
click to vote
CRYPTO
2005
Springer
15 years 11 months ago
2005
Springer
In many important applications, a collection of mutually distrustful parties must perform private computation over multisets. Each party’s input to the function is his private i...
142
click to vote
SIGGRAPH
1994
ACM
15 years 10 months ago
1994
ACM
The use of double-buffered displays, in which the previous image is displayed until the next image is complete, can impair the interactivity of systems that require tight coupling...
200
click to vote
SCN
2010
Springer
15 years 4 months ago
2010
Springer
Exposure of a secret key is a significant threat in practice. As a notion of security against key exposure, Dodis et al. advocated key-insulated security, and proposed concrete k...