Sciweavers

118 search results - page 7 / 24
» Ideal Secret Sharing Schemes from Permutations
Sort
View
CRYPTO
2005
Springer
127views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
A black-box secret sharing scheme (BBSSS) for a given access structure works in exactly the same way over any finite Abelian group, as it only requires black-box access to group o...
Ronald Cramer, Serge Fehr, Martijn Stam
JCM
2008
74views more  JCM 2008»
13 years 8 months ago
Publicly Verifiable Secret Sharing Member-join Protocol For Threshold Signatures
Publicly verifiable secret sharing (PVSS) allows not only shareholders themselves but also everyone verify the shares of a secret distributed by a dealer. It has a lot of electroni...
Jia Yu, Fanyu Kong, Rong Hao, Xuliang Li, Guowen L...
FOCS
2007
IEEE
14 years 2 months ago
Intrusion-Resilient Secret Sharing
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
Stefan Dziembowski, Krzysztof Pietrzak
CRYPTO
2008
Springer
120views Cryptology» more  CRYPTO 2008»
13 years 10 months ago
The Random Oracle Model and the Ideal Cipher Model Are Equivalent
The Random Oracle Model and the Ideal Cipher Model are two well known idealised models of computation for proving the security of cryptosystems. At Crypto 2005, Coron et al. showed...
Jean-Sébastien Coron, Jacques Patarin, Yann...
IJNSEC
2011
77views more  IJNSEC 2011»
13 years 3 months ago
Performance Evaluation of the TSS Node Authentication Scheme in Noisy MANETs
This paper presents a description and performance evaluation of a threshold secret sharing (TSS) node authentication scheme in noisy mobile ad hoc networks (MANETs). The scheme ca...
Hussein Al-Bahadili, Shakir Hussain, Ghassan Issa,...