87 search results - page 1 / 18 » Random Selection with an Adversarial Majority |
CRYPTO
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
CRYPTO
2004
Springer
14 years 14 days ago
2004
Springer
We construct two efficient Identity Based Encryption (IBE) systems that are selective identity secure without the random oracle model. Selective identity secure IBE is a slightly w...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Security at major locations of economic or political importance is a key concern around the world, particularly given the threat of terrorism. Limited security resources prevent f...
SCN
2008
Springer
13 years 7 months ago
2008
Springer
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...