Sciweavers

241 search results - page 22 / 49
» On Proactive Secret Sharing Schemes
Sort
View
SCN
2008
Springer
141views Communications» more  SCN 2008»
13 years 8 months ago
Improved Privacy of the Tree-Based Hash Protocols Using Physically Unclonable Function
In 2004, Molnar and Wagner introduced a very appealing scheme dedicated to the identification of RFID tags. Their protocol relies on a binary tree of secrets which are shared
Julien Bringer, Hervé Chabanne, Thomas Icar...
ICIP
2003
IEEE
14 years 10 months ago
Halftone visual cryptography
This paper considers the problem of encoding a secret binary image SI into n shares of meaningful halftone images within the scheme of visual cryptography (VC). Secret pixels enco...
Z. Zhou, Gonzalo R. Arce, Giovanni Di Crescenzo
ASIACRYPT
2000
Springer
14 years 1 months ago
Provably Secure Metering Scheme
Abstract. Naor and Pinkas introduced metering schemes at Eurocrypt ’98 in order to decide on advertisement fees for web servers. In the schemes, any server should be able to cons...
Wakaha Ogata, Kaoru Kurosawa
CSREASAM
2007
13 years 10 months ago
Allocation of Partitioned Data by Using A Neural Network Based Approach
In this paper, we investigate allocation of data partitions in the network for data objects that are partitioned by using secret sharing schemes [12] or erasure coding schemes [11...
Manghui Tu, Dongfeng Wang, Peng Li, Nasser Tadayon
TCC
2009
Springer
154views Cryptology» more  TCC 2009»
14 years 9 months ago
Fairness with an Honest Minority and a Rational Majority
We provide a simple protocol for secret reconstruction in any threshold secret sharing scheme, and prove that it is fair when executed with many rational parties together with a s...
Shien Jin Ong, David C. Parkes, Alon Rosen, Salil ...