Highly efficient secrecy-preserving proofs of correctness of computations and applications

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2007, Pages 63-76

  Rabin, Michael O ^a   Servedio, Rocco A ^b   Thorpe, Christopher ^a  

^a HARVARD UNIVERSITY   (United States)

^b Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INPUT VALUES; SECURE PROCESSORS;

COMPUTATION THEORY;

EID: 82755188831     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2007.24     Document Type: Conference Paper

References (11)

1. G. Brassard, D. Chaum, and C. Crépeau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 37:156-189, 1988.
2. E. Brickell, D. Chaum, I. Damgård, and J. V. de Graaf. Gradual and verifiable release of a secret. In Proceedings of CRYPTO'87, volume LNCS 293, pages 156-166, 1988.
3. J. Camenisch and V. Shoup. Practical verifiable encryption and decryption of discrete logarithms. Full length version of extended abstract in Proc. Crypto 2003, available at http://eprint.iacr.org/2002/161.pdf, 2003.
4. I. Damgård, T. Pedersen, and B. Pfitzmann. Statistical secrecy and multibit commitments. IEEE Transactions on Information Theory, 44(3):1143-1151, 1998. (Pubitemid 128743273)
5. A. Fiat and A. Shamir. How to prove youself: practical solutions to identification and signature problems. In Proceedings of CRYPTO'86, pages 186-194, 1987.
6. J. Kilian. A note on efficient zero-knowledge proofs and arguments. In Proceedings of STOC'92, pages 723-732, 1992. (Pubitemid 23608089)
7. J. McHugh. Covert channel analysis. Chapter 8 of Handbook for the Computer Security Certification of Trusted Systems, NRL Technical Memorandum, available at http://chacs.nrl.navy.mil/publications/handbook/COVCHAN.pdf, 1996.
8. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In J. Stern, editor, Advances in Cryptology - (EUROCRYPT 1999), volume 1592 of Lecture Notes in Computer Science, pages 107-122. SpringerVerlag, 1999.
9. D. C. Parkes, M. O. Rabin, S. M. Shieber, and C. A. Thorpe. Practical secrecy-preserving, verifiably correct and trustworthy auctions. In Proceedings of the 8th International Conference on Electronic Commerce (ICEC), pages 70-81, 2006. (Pubitemid 47140648)
10. M. O. Rabin and J. O. Shallit. Randomized algorithms in number theory. Communications in Pure and Applied Mathematics, 39:239-256, 1986.
11. M. O. Rabin and C. Thorpe. Time-lapse cryptography. Technical Report TR-22-06, Harvard University School of Engineering and Computer Science, 2006.