Sciweavers

978 search results - page 41 / 196
» Knowledge, Probability, and Adversaries
Sort
View
EUROCRYPT
2004
Springer
15 years 3 months ago
Practical Large-Scale Distributed Key Generation
Generating a distributed key, where a constant fraction of the players can reconstruct the key, is an essential component of many largescale distributed computing tasks such as ful...
John F. Canny, Stephen Sorkin
ICICS
2004
Springer
15 years 3 months ago
Factorization-Based Fail-Stop Signatures Revisited
Fail-stop signature (FSS) schemes are important primitives because in a fail-stop signature scheme the signer is protected against unlimited powerful adversaries as follows: Even i...
Katja Schmidt-Samoa
ACSAC
2007
IEEE
15 years 1 months ago
Efficient Distributed Detection of Node Replication Attacks in Sensor Networks
Wireless sensor nodes lack hardware support for tamperresistance and are often deployed in unattended environments, thus leaving them vulnerable to capture and compromise by an ad...
Bo Zhu, Venkata Gopala Krishna Addada, Sanjeev Set...
62
Voted
ESA
2009
Springer
98views Algorithms» more  ESA 2009»
15 years 4 months ago
The Oil Searching Problem
Given n potential oil locations, where each has oil at a certain depth, we seek good trade-offs between the number of oil sources found and the total amount of drilling performed. ...
Andrew McGregor, Krzysztof Onak, Rina Panigrahy
EUROCRYPT
2001
Springer
15 years 2 months ago
On Perfect and Adaptive Security in Exposure-Resilient Cryptography
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with...
Yevgeniy Dodis, Amit Sahai, Adam Smith