Sciweavers

978 search results - page 40 / 196
» Knowledge, Probability, and Adversaries
Sort
View
PROVSEC
2010
Springer
14 years 7 months ago
Improved Zero-Knowledge Identification with Lattices
Zero-knowledge identification schemes solve the problem of authenticating one party to another via an insecure channel without disclosing any additional information that might be u...
Pierre-Louis Cayrel, Richard Lindner, Markus R&uum...
ICIP
2005
IEEE
15 years 11 months ago
Risk minimization in traitors within traitors in multimedia forensics
In digital fingerprinting and multimedia forensic systems, it is possible that multiple adversaries mount attacks collectively and effectively to undermine the forensic system...
H. Vicky Zhao, K. J. Ray Liu
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
15 years 11 months ago
Proof Sketches: Verifiable In-Network Aggregation
Recent work on distributed, in-network aggregation assumes a benign population of participants. Unfortunately, modern distributed systems are plagued by malicious participants. In...
Minos N. Garofalakis, Joseph M. Hellerstein, Petro...
ACSAC
2006
IEEE
15 years 3 months ago
PAST: Probabilistic Authentication of Sensor Timestamps
Sensor networks are deployed to monitor the physical environment in public and vulnerable locations. It is not economically viable to house sensors in tamper-resilient enclosures ...
Ashish Gehani, Surendar Chandra
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
15 years 3 months ago
Making Chord Robust to Byzantine Attacks
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
Amos Fiat, Jared Saia, Maxwell Young