198 search results - page 21 / 40 » The Multiplicative Quantum Adversary |
PERCOM
2006
ACM
14 years 7 months ago
2006
ACM
Typical packet traffic in a sensor network reveals pronouncedpatterns that allow an adversary analyzing packet traffic to deduce the location of a base station. Once discovered, t...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
– When implementing public key security ser- easy for an adversary to collect data and attack. To solve this vices in mobile ad hoc networks (MANETs), multiple problem, the distr...
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
ICPADS
2007
IEEE
14 years 1 months ago
2007
IEEE
Security is a common problem in completely decentralized peer-to-peer systems. Although several suggestions exist on how to create a secure key-based routing protocol, a practicab...
CRYPTO
2001
Springer
14 years 4 days ago
2001
Springer
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...