Sciweavers

222 search results - page 6 / 45
» How to Forget a Secret
Sort
View
ICALT
2005
IEEE
15 years 3 months ago
Application of Instant Message System in Cooperative Learning
The popularity of instant messaging (IM) system creates a new way for human communication. Along with this trend, IM system is broadly applied in cooperative learning. There isnâ€...
Shih-chen Hsieh, Yu-chen Hsu
CORR
2010
Springer
90views Education» more  CORR 2010»
14 years 8 months ago
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
Sirin Nitinawarat, Prakash Narayan
CIS
2007
Springer
15 years 4 months ago
Controlled Secret Leakage
— Privacy is the claim of individuals, groups and institutions to determine for themselves, when, how and to what extent information about them is communicated to others. How to ...
Tianjie Cao, Shi Huang, Hui Cui, Yipeng Wu, Qihan ...
EUROCRYPT
2000
Springer
15 years 1 months ago
Exposure-Resilient Functions and All-or-Nothing Transforms
Abstract. We study the problem of partial key exposure. Standard cryptographic definitions and constructions do not guarantee any security even if a tiny fraction of the secret key...
Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kus...
TCC
2004
Springer
164views Cryptology» more  TCC 2004»
15 years 3 months ago
Hierarchical Threshold Secret Sharing
We consider the problem of threshold secret sharing in groups with hierarchical structure. In such settings, the secret is shared among a group of participants that is partitioned ...
Tamir Tassa