Sciweavers

563 search results - page 16 / 113
» Verifiable Signature Sharing
Sort
View
CSI
2007
54views more  CSI 2007»
14 years 11 months ago
A practical verifiable multi-secret sharing scheme
C.-C. Yang, T.-Y. Chang, M.-S. Hwang [C.-C. Yang, T.-Y. Chang, M.-S. Hwang, A (t,n) multi-secret sharing scheme, Applied Mathematics and Computation 151 (2004) 483–490] proposed...
Jian-jie Zhao, Jianzhong Zhang 0005, Rong Zhao
ACNS
2005
Springer
85views Cryptology» more  ACNS 2005»
15 years 5 months ago
New Signature Schemes with Coupons and Tight Reduction
Amongst provably secure signature schemes, two distinct classes are of particular interest: the ones with tight reduction (e.g., RSA-PSS), and those which support the use of coupon...
Benoît Chevallier-Mames
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
15 years 3 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
ICISC
2004
146views Cryptology» more  ICISC 2004»
15 years 1 months ago
Identity Based Threshold Ring Signature
In threshold ring signature schemes, any group of t entities spontaneously conscript arbitrarily n - t entities to generate a publicly verifiable t-out-of-n signature on behalf of ...
Sherman S. M. Chow, Lucas Chi Kwong Hui, Siu-Ming ...
ASIACRYPT
2010
Springer
14 years 9 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