1 |
"The NIST special publication on computer security" (sp 800-78 rev 1 of august 2007). 2007. Available at http://csrc.nist.gov/publications/nistpubs/.
|
2 |
D Boneh and H Shacham. "Fast variants of RSA. In CryptoBytes", Vol.5, No.1. 2002, pp.1-9.
|
3 |
F Boudot and J Traore. "Efficient public verifiable secret sharing schemes with fast or delayed recovery." In ICICS '99, pp.87-102.
|
4 |
F Boudot. "Efficient proofs that a committed number lies in an interval." In EUROCRYPT '00, LNCS1807, pp.431-444.
|
5 |
D Chaum and T Pedersen. "Wallet databases with observers." In CRYPTO '92, LNCS740, pp.89-105.
|
6 |
D Coppersmith. "Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities." In Journal of Cryptology Vol.10, No.4, 1997, pp.233-260.
DOI
|
7 |
P Feldman. "A practical scheme for non-interactive verifiable secret sharing." In FOCS '87, pp.427-437.
|
8 |
E Fujisaki and T Okamoto. "A practical and provably secure scheme for publicly verifiable secret sharing and its applications." In EUROCRYPT '98, pp.32-46.
|
9 |
K Peng and F Bao. "Efficient publicly verifiable secret sharing with correctness, soundness and ZK privacy." In WISA '09, LNCS5932, pp.118-132.
|
10 |
B Schoenmakers. "A simple publicly verifiable secret sharing scheme and its application to electronic voting." In CRYPTO '99, pp.149-164.
|
11 |
C Schnorr. "Efficient signature generation by smart cards." Journal of Cryptology, 4, 1991, pp.161-174.
|
12 |
A Shamir. "How to share a secret." Communication of the ACM, c(11):612-613, November 1979.
DOI
ScienceOn
|
13 |
M Stadler. "Publicly verifiable secret sharing." In EUROCRYPT '96, pp.190-199.
|