Sciweavers

1054 search results - page 158 / 211
» Secret Communication with Feedback
Sort
View
CCS
2008
ACM
14 years 12 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
JUCS
2008
156views more  JUCS 2008»
14 years 9 months ago
Efficient k-out-of-n Oblivious Transfer Schemes
Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme a...
Cheng-Kang Chu, Wen-Guey Tzeng
JUCS
2008
147views more  JUCS 2008»
14 years 9 months ago
Security and Usability Aspects of Man-in-the-Middle Attacks on ZRTP
Abstract: ZRTP is a protocol designed to set up a shared secret between two communication parties which is subsequently used to secure the media stream (i.e. the audio data) of a V...
Martin Petraschek, Thomas Hoeher, Oliver Jung, Hel...
JUCS
2008
113views more  JUCS 2008»
14 years 9 months ago
Enhancing ZRTP by using Computational Puzzles
Abstract: In this paper we present and discuss a new approach for securing multimedia communication, which is based on three innovations. The first innovation is the integration of...
Helmut Hlavacs, Wilfried N. Gansterer, Hannes Scha...
CCR
2005
76views more  CCR 2005»
14 years 9 months ago
Simplifying the synthesis of internet traffic matrices
A recent paper [8] presented methods for several steps along the road to synthesis of realistic traffic matrices. Such synthesis is needed because traffic matrices are a crucial i...
Matthew Roughan