Sciweavers

1612 search results - page 112 / 323
» About models of security protocols
Sort
View
EUROCRYPT
2000
Springer
15 years 7 months ago
Minimal-Latency Secure Function Evaluation
Sander, Young and Yung recently exhibited a protocol for computing on encrypted inputs, for functions computable in NC1 . In their variant of secure function evaluation, Bob (the &...
Donald Beaver
COMCOM
2006
121views more  COMCOM 2006»
15 years 4 months ago
Interactive Transparent Networking: Protocol meta modeling based on EFSM
the extensibility and evolution of network services and protocols had become a major research issue in recent years. The 'programmable' and 'active' network par...
Javed I. Khan, Raid Zaghal
CORR
2006
Springer
82views Education» more  CORR 2006»
15 years 4 months ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...
EUROCRYPT
2004
Springer
15 years 9 months ago
Public-Key Steganography
Informally, a public-key steganography protocol allows two parties, who have never met or exchanged a secret, to send hidden messages over a public channel so that an adversary can...
Luis von Ahn, Nicholas J. Hopper
MOBIHOC
2005
ACM
16 years 3 months ago
A secure ad-hoc routing approach using localized self-healing communities
Mobile ad hoc networks (MANETs) are vulnerable to routing attacks, especially attacks launched by non-cooperative (selfish or compromised) network members and appear to be protoco...
Jiejun Kong, Xiaoyan Hong, Yunjung Yi, Joon-Sang P...