94 search results - page 8 / 19 » On the complexity of verifiable secret sharing and multipart... |
HICSS
2009
IEEE
14 years 3 months ago
2009
IEEE
A simple theoretical framework is developed to evaluate the security and usability of eavesdroppingresistant authentication schemes. Such schemes strive to allow users to authenti...
UAI
2004
13 years 10 months ago
2004
We introduce the study of sequential information elicitation in strategic multi-agent systems. In an information elicitation setup a center attempts to compute the value of a func...
ESORICS
2008
Springer
13 years 10 months ago
2008
Springer
Gathering and processing sensitive data is a difficult task. In fact, there is no common recipe for building the necessary information systems. In this paper, we present a provably...
EUROCRYPT
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We present two universally composable and practical protocols by which a dealer can, verifiably and non-interactively, secret-share an integer among a set of players. Mo...
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...