Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications
暂无分享,去创建一个
[1] Michael O. Rabin,et al. Time-Lapse Cryptography Technical Report TR-2206 , 2006 .
[2] Ivan Damgård,et al. Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments , 1997, STOC '97.
[3] Ernest F. Brickell,et al. Gradual and Verifiable Release of a Secret , 1987, CRYPTO.
[4] Christopher Thorpe,et al. Time-Lapse Cryptography , 2006 .
[5] R. Cramer,et al. Linear Zero-Knowledgde. A Note on Efficient Zero-Knowledge Proofs and Arguments , 1996 .
[6] Clark Weissman. Handbook for the Computer Security Certification of Trusted Systems , 1995 .
[7] Ivan Damgård,et al. Statistical Secrecy and Multibit Commitments , 1998, IEEE Trans. Inf. Theory.
[8] Rasmus Ejlers Møgelberg,et al. Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science , 2007 .
[9] Jan Camenisch,et al. Practical Verifiable Encryption and Decryption of Discrete Logarithms , 2003, CRYPTO.
[10] David C. Parkes,et al. Practical secrecy-preserving, verifiably correct and trustworthy auctions , 2006, ICEC '06.
[11] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.
[12] David C. Parkes,et al. Practical secrecy-preserving, verifiably correct and trustworthy auctions , 2006, ICEC '06.
[13] M. Rabin,et al. Randomized algorithms in number theory , 1985 .
[14] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[15] David Chaum,et al. Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..