Improving cut-and-choose in verifiable encryption and fair exchange protocols using trusted computing technology

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5645 LNCS, Issue , 2009, Pages 252-267

  Tate, Stephen R ^a   Vishwanathan, Roopa ^b  

^a UNIVERSITY OF NORTH CAROLINA AT GREENSBORO   (United States)

^b UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AMOUNT OF INTERACTION; COMPUTATIONAL REQUIREMENTS; CURRENT SYSTEM; FAIR EXCHANGE; FAIR-EXCHANGE PROTOCOLS; HIGH PROBABILITY; INTERACTIVE PROTOCOLS; NON-INTERACTIVE PROTOCOLS; RANDOM DATA; RANDOM VALUES; TRUSTED COMPUTING TECHNOLOGY; TRUSTED PLATFORM MODULE; ZERO-KNOWLEDGE PROTOCOLS; OPTIMISTIC FAIR EXCHANGES; VERIFIABLE ENCRYPTIONS;

CRYPTOGRAPHY; NETWORK PROTOCOLS; PROBABILITY DENSITY FUNCTION; HARDWARE; SECURITY OF DATA;

NETWORK SECURITY; TRUSTED COMPUTING;

EID: 70350754104     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03007-9_17     Document Type: Conference Paper

References (35)

1. Asokan, N., Shoup, V., Waidner, M.: Optimistic Fair Exchange of Digital Signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 591-606. Springer, Heidelberg (1998)
2. Bao, F., Deng, R., Mao, W.: Efficient and Practical Fair Exchange Protocols with an Off-line TTP. In: Proceedings of the 19th IEEE Symposium on Security and Privacy, pp. 77-85 (1998)
3. Barak, B., Prabhakaran, M., Sahai, A.: Concurrent Non-Malleable Zero Knowledge. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 345-354 (2006)
4. Bellare, M., Palacio, A.: GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and concurrent attacks. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 162-177. Springer, Heidelberg (2002)
5. Blakley, G.: Safeguarding Cryptographic Keys. In: AFIPS National Computer Conference, pp. 313-317 (1979)
6. Brands, S.: Untraceable Off-line Cash in Wallets with Observers. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 302-318. Springer, Heidelberg (1994)
7. Camenisch, J., Damgard, I.: Verifiable Encryption, Group Encryption, and their Applications to Separable Group Signatures and Signature Sharing Schemes. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 331-345. Springer, Heidelberg (2000)
8. Camenisch, J., Lysyanskaya, A.: An identity escrow scheme with appointed verifiers. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 388-407. Springer, Heidelberg (2001)
9. Camenisch, J., Shoup, V.: Practical Verifiable Encryption and Decryption of Discrete Logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 126-144. Springer, Heidelberg (2003)
10. Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: IEEE Symposium on Foundations of Computer Science, pp. 136-145 (2001)
11. Chandran, N., Goyal, V., Sahai, A.: New Constructions for UC Secure Computation using Tamper Proof Hardware. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 545-562. Springer, Heidelberg (2008)
12. Chaum, D., Pedersen, T.P.: Wallet Databases with Observers (extended abstract). In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89-105. Springer, Heidelberg (1993)
13. Cramer, R., Pedersen, T.J.: Improved Privcy in Wallets with Observers (extended abstract). In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 329-343. Springer, Heidelberg (1994)
14. Damgard, I., Nielsen, J.B., Wichs, D.: Isolated Proofs of Knowledge and Isolated Zero Knowledge. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 509-526. Springer, Heidelberg (2008)
15. Feldman, P.: A Practical Scheme for Non-interactive Verifiable Secret Sharing. In: FOCS 1987, pp. 427-437. IEEE Computer Society, Los Alamitos (1987)
16. Fiat, A., Shamir, A.: How to prove to yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186-194. Springer, Heidelberg (1987)
17. Franklin, M., Reiter, M.: Verifiable Signature Sharing. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 50-63. Springer, Heidelberg (1995)
18. Gennaro, R.: Multi-trapdoor Commitments and their Applications to Proofs of Knowledge Secure under Concurrent Man-in-the-Middle Attacks (2004)
19. Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. SIAM Jounal of Computing, 186-208 (1989)
20. Groth, J.: A verifiable Secret Shuffle of Homomorphic Encryptions. In: Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography, pp. 145-160 (2003)
21. Trusted Computing Group. Protection profile - PC client specific trusted platform module, https://www.trustedcomputinggroup.org/specs/TPM/ (TPM Family 1.2; Level 2)
22. Trusted Computing Group. Trusted Platform Module Specifications - Parts 1-3, https://www.trustedcomputinggroup.org/specs/TPM/
23. Guillou, L., Quisquater, J.: A "paradoxical" identity-based signature scheme resulting from zero-knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 216-231. Springer, Heidelberg (1990)
24. Gunupudi, V., Tate, S.R.: Random Oracle Instantiation of Distributed Protocols using Trusted Platform Modules. In: 21st International Conference on Advanced Information Networking Applications, pp. 463-469 (2007)
25. Gunupudi, V., Tate, S.R.: Generalized Non Interactive Oblivious Transfer using Count-Limited Objects with Applications to Secure Mobile Agents. In: Tsudik, G. (ed.) FC 2008. LNCS, vol. 5143, pp. 98-112. Springer, Heidelberg (2008)
26. Katz, J.: Universally Composable Multi Party Computation using Tamper-proof Hardware. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 115-128. Springer, Heidelberg (2007)
27. Krawczyk, H.: Secret sharing made short. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 136-146. Springer, Heidelberg (1994)
28. Moran, T., Segev, G.: David and Goliath Commitments: UC Computation for Asymmetric Parties using Tamper-proof Hardware. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 527-544. Springer, Heidelberg (2008)
29. Poupard, G., Stern, J.: Fair Encryption of RSA Keys. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 172-190. Springer, Heidelberg (2000)
30. Ray, I., Ray, I.: Fair Exchange in E-Commerce. In: Proceedings of ACM SIGEcom Exchange, pp. 9-17 (2002)
31. Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 120-126 (1978)
32. Sarmenta, L.F.G., van Dijk, M., O'Donnell, C.W., Rhodes, J., Devadas, S.: Virtual Monotonic Counters and Count-Limited Objects using a TPM without a Trusted OS. In: STC 2006 (2006)
33. Schnorr, C.: Efficient Signature Generation by Smart Cards. Journal of Cryptology, 161-174 (1991)
34. Shamir, A.: How to share a secret. Communications of the ACM, 612-623 (1979)
35. Tate, S.R., Vishwanathan, R.: Improving cut-and-choose in verifiable encryption and fair exchange protocols using trusted computing technology, http://eprint.iacr.org/