Sciweavers

2601 search results - page 34 / 521
» Secure Rewarding Schemes
Sort
View
ASIACRYPT
2008
Springer
15 years 1 months ago
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
In this paper, we show that two variants of Stern's identification scheme [IEEE Transaction on Information Theory '96] are provably secure against concurrent attack unde...
Akinori Kawachi, Keisuke Tanaka, Keita Xagawa
ICMCS
2006
IEEE
128views Multimedia» more  ICMCS 2006»
15 years 5 months ago
On the Security of Multimedia Encryption Schemes Based on Multiple Huffman Table (MHT)
This paper addresses the security issues of the multimedia encryption schemes based on multiple Huffman table (MHT). A detailed analysis of known-plaintext attack is presented to ...
Jiantao Zhou, Zhiqin Liang, Yan Chen, Oscar C. Au
IJNSEC
2007
109views more  IJNSEC 2007»
14 years 11 months ago
SeReRoM: Secured Reliable Routing Scheme for Multicasting
This paper proposes a multipath routing scheme SeReRoM for a multicast group communication with a single source and multiple destinations. SeReRoM provides an environment that tac...
Rajavelu Srinivasan, V. Vaidehi, K. N. Srivathsan,...
IPL
2006
87views more  IPL 2006»
14 years 11 months ago
Strongly secure ramp secret sharing schemes for general access structures
Ramp secret sharing (SS) schemes can be classified into strong ramp SS schemes and weak ramp SS schemes. The strong ramp SS schemes do not leak out any part of a secret explicitly...
Mitsugu Iwamoto, Hirosuke Yamamoto
IACR
2011
90views more  IACR 2011»
13 years 11 months ago
On the Security of the Winternitz One-Time Signature Scheme
Abstract. We show that the Winternitz one-time signature scheme is existentially unforgeable under adaptive chosen message attacks when instantiated with a family of pseudo random ...
Johannes Buchmann, Erik Dahmen, Sarah Ereth, Andre...