80 search results - page 16 / 16 » Zero-knowledge from secure multiparty computation |
NDSS
2007
IEEE
13 years 12 months ago
2007
IEEE
With Hidden Credentials Alice can send policyencrypted data to Bob in such a way that he can decrypt the data only with the right combination of credentials. Alice gains no knowle...
IANDC
2007
13 years 5 months ago
2007
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
ATAL
2005
Springer
13 years 11 months ago
2005
Springer
The aggregation of conflicting preferences is a key issue in multiagent systems. Due to its universality, voting has a central role among preference aggregation mechanisms. Votin...
PKC
2009
Springer
14 years 6 months ago
2009
Springer
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
ASIACRYPT
2001
Springer
13 years 10 months ago
2001
Springer
The aim of this article is to propose a fully distributed environment for the RSA scheme. What we have in mind is highly sensitive applications and even if we are ready to pay a pr...