Improving Cut-and-Choose in Verifiable Encryption and Fair Exchange Protocols Using Trusted Computing Technology-Reference-Cited by-同舟云学术

Improving Cut-and-Choose in Verifiable Encryption and Fair Exchange Protocols Using Trusted Computing Technology

Published:2009 Issue: Volume: Page:252-267
ISSN:0302-9743
Container-title:Data and Applications Security XXIII
language:
Short-container-title:

Author:

Tate Stephen R.,Vishwanathan Roopa

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-03007-9_17

Reference35 articles.

1. Lecture Notes in Computer Science;N. Asokan,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. Lecture Notes in Computer Science;M. Bellare,2002

5. Blakley, G.: Safeguarding Cryptographic Keys. In: AFIPS National Computer Conference, pp. 313–317 (1979)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. FaDe: A Blockchain-Based Fair Data Exchange Scheme for Big Data Sharing;Future Internet;2019-10-24

2. A Privacy Preserving Source Verifiable Encryption Scheme;Information Security Practice and Experience;2016

3. Methods for Restricting Message Space in Public-Key Encryption;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2013

4. Secure Set Intersection with Untrusted Hardware Tokens;Topics in Cryptology – CT-RSA 2011;2011

5. Towards Restricting Plaintext Space in Public Key Encryption;Advances in Information and Computer Security;2011