Sciweavers

62 search results - page 12 / 13
» A Latency-Free Election Scheme
Sort
View
SPW
2004
Springer
13 years 10 months ago
The Dancing Bear: A New Way of Composing Ciphers
This note presents a new way of composing cryptographic primitives which makes some novel combinations possible. For example, one can do threshold decryption using standard block c...
Ross Anderson
SIAMCOMP
2002
98views more  SIAMCOMP 2002»
13 years 5 months ago
Self-Stabilizing Symmetry Breaking in Constant Space
abstract Alain Mayer Yoram Ofeky Rafail Ostrovskyz Moti Yungx We investigate the problem of self-stabilizing round-robin token management scheme on an anonymous bidirectional ring...
Alain J. Mayer, Rafail Ostrovsky, Yoram Ofek, Moti...
CSI
2010
91views more  CSI 2010»
13 years 5 months ago
Towards trustworthy e-voting using paper receipts
Current electronic voting systems are not sufficient to satisfy trustworthy elections as they do not provide any proofs or confirming evidences of their honesty. This lack of trust...
Yunho Lee, Sangjoon Park, Masahiro Mambo, Seungjoo...
ICC
1997
IEEE
133views Communications» more  ICC 1997»
13 years 9 months ago
MESH: Distributed Error Recovery for Multimedia Streams in Wide-Area Multicast Networks
This paper addresses support for nzulti-party multimedia applications delivered across datagram wide-area networks such as the Internet. Our approach is to develop a novel retrans...
Matthew T. Lucas, Bert J. Dempsey, Alfred C. Weave...
IH
1998
Springer
13 years 9 months ago
Attacks on Copyright Marking Systems
In the last few years, a large number of schemes have been proposed for hiding copyright marks and other information in digital pictures, video, audio and other multimedia objects....
Fabien A. P. Petitcolas, Ross J. Anderson, Markus ...