Sciweavers

380 search results - page 4 / 76
» Intrusion-Resilient Secret Sharing
Sort
View
CRYPTO
2012
Springer
268views Cryptology» more  CRYPTO 2012»
12 years 7 days ago
Secret Sharing Schemes for Very Dense Graphs
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
Amos Beimel, Oriol Farràs, Yuval Mintz
INFOCOM
2010
IEEE
13 years 8 months ago
Exploiting Multiple-Antenna Diversity for Shared Secret Key Generation in Wireless Networks
—Generating a secret key between two parties by extracting the shared randomness in the wireless fading channel is an emerging area of research. Previous works focus mainly on si...
Kai Zeng, Daniel Wu, An Chan, Prasant Mohapatra
ICWN
2009
13 years 7 months ago
Threshold Secret Sharing Authentication Scheme in Noisy Mobile Ad Hoc Networks
- This paper presents a description and performance evaluation of a threshold secret sharing (TSS) authentication scheme for selfsecuring mobile ad hoc networks (MANETs) suffering ...
Shakir Hussain, Hussein Al-Bahadili, Ghassan Issa,...
TPDS
1998
94views more  TPDS 1998»
13 years 9 months ago
Access Control and Signatures via Quorum Secret Sharing
—We suggest a method of controlling the access to a secure database via quorum systems. A quorum system is a collection of sets (quorums) every two of which have a nonempty inter...
Moni Naor, Avishai Wool
ASIACRYPT
2010
Springer
13 years 7 months ago
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan