Democratic Systems
暂无分享,去创建一个
[1] Josh Benaloh,et al. Secret Sharing Homomorphisms: Keeping Shares of A Secret Sharing , 1986, CRYPTO.
[2] Narn-Yih Lee,et al. Threshold-Multisignature Schemes where Suspected Forgery Implies Traceability of Adversarial Shareholders , 1994, EUROCRYPT.
[3] Dorothy E. Denning,et al. Programming Techniques and Data Structures Digital Signatures with Rsa and Other Public.key , 2022 .
[4] Markus Stadler,et al. Publicly Verifiable Secret Sharing , 1996, EUROCRYPT.
[5] Tzonelih Hwang,et al. Remark on the Threshold RSA Signature Scheme , 1993, CRYPTO.
[6] Yvo Desmedt,et al. Shared Generation of Authenticators and Signatures (Extended Abstract) , 1991, CRYPTO.
[7] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[8] Susan K. Langford. Threshold DSS Signatures without a Trusted Party , 1995, CRYPTO.
[9] Michael K. Reiter,et al. Secure agreement protocols: reliable and atomic group multicast in rampart , 1994, CCS '94.
[10] K. Kurosawa,et al. New EIGamal Type Threshold Digital Signature Scheme , 1996 .
[11] L. Harn. Group-oriented (t, n) threshold digital signature scheme and digital multisignature , 1994 .
[12] Adi Shamir,et al. How to share a secret , 1979, CACM.
[13] Torben P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.
[14] Yvo Desmedt,et al. Verifiable Democracy , 1999, Communications and Multimedia Security.
[15] Silvio Micali,et al. Verifiable Secret Sharing as Secure Computation , 1994, EUROCRYPT.
[16] G. R. BLAKLEY. Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).