Proofs of Storage from Homomorphic Identification Protocols
暂无分享,去创建一个
[1] Victor Shoup. On the Security of a Practical Identification Scheme , 1996, EUROCRYPT.
[2] Jens Groth,et al. A Verifiable Secret Shuffle of Homomorphic Encryptions , 2003, Journal of Cryptology.
[3] Yevgeniy Dodis,et al. Proofs of Retrievability via Hardness Amplification , 2009, IACR Cryptol. ePrint Arch..
[4] Mihir Bellare,et al. On Defining Proofs of Knowledge , 1992, CRYPTO.
[5] Niklaus Wirth,et al. Advances in Cryptology — EUROCRYPT ’88 , 2000, Lecture Notes in Computer Science.
[6] Reza Curtmola,et al. Provable data possession at untrusted stores , 2007, CCS '07.
[7] Amos Fiat,et al. Zero-knowledge proofs of identity , 1988, Journal of Cryptology.
[8] Roberto Di Pietro,et al. Scalable and efficient provable data possession , 2008, IACR Cryptol. ePrint Arch..
[9] Ari Juels,et al. Pors: proofs of retrievability for large files , 2007, CCS '07.
[10] Josef Pieprzyk,et al. Advances in Cryptology - ASIACRYPT 2008, 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7-11, 2008. Proceedings , 2008, ASIACRYPT.
[11] Moni Naor,et al. The complexity of online memory checking , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[12] Oded Goldreich,et al. How to construct constant-round zero-knowledge proof systems for NP , 1996, Journal of Cryptology.
[13] Ernest F. Brickell,et al. Advances in Cryptology — CRYPTO’ 92 , 2001, Lecture Notes in Computer Science.
[14] Jean-Jacques Quisquater,et al. A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory , 1988, EUROCRYPT.
[15] Yehuda Lindell,et al. Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation , 2001, Journal of Cryptology.
[16] Ari Juels,et al. Proofs of retrievability: theory and implementation , 2009, CCSW '09.