Sciweavers

876 search results - page 86 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
SCN
2010
Springer
176views Communications» more  SCN 2010»
15 years 5 months ago
The Fiat-Shamir Transform for Group and Ring Signature Schemes
The Fiat-Shamir (FS) transform is a popular tool to produce particularly efficient digital signature schemes out of identification protocols. It is known that the resulting signat...
Ming-Feng Lee, Nigel P. Smart, Bogdan Warinschi
SCN
2010
Springer
232views Communications» more  SCN 2010»
15 years 4 months ago
Authenticated Key Agreement with Key Re-use in the Short Authenticated Strings Model
Serge Vaudenay [20] introduced a notion of Message Authentication (MA) protocols in the Short Authenticated String (SAS) model. A SAS-MA protocol authenticates arbitrarily long mes...
Stanislaw Jarecki, Nitesh Saxena
ECCV
2010
Springer
15 years 12 months ago
Graph Cut based Inference with Co-occurrence Statistics
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
AAAI
2008
15 years 9 months ago
ARMOR Security for Los Angeles International Airport
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...
James Pita, Manish Jain, Fernando Ordó&ntil...
PE
2008
Springer
108views Optimization» more  PE 2008»
15 years 6 months ago
Rate-optimal schemes for Peer-to-Peer live streaming
In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several models of ...
Laurent Massoulié, Andrew Twigg