On the analysis of time-aware protocols in universal composability framework-Reference-Cited by-同舟云学术

On the analysis of time-aware protocols in universal composability framework

Published:2015-08-23 Issue:4 Volume:15 Page:403-412
ISSN:1615-5262
Container-title:International Journal of Information Security
language:en
Short-container-title:Int. J. Inf. Secur.

Author:

Vajda István

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Safety, Risk, Reliability and Quality,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/s10207-015-0300-2.pdf

Reference11 articles.

1. Backes, M., Pfitzmann, B., Waidner, M.: A universally composable cryptographic library. In: IACR Cryptology ePrint Archive, Report 2003/015. http://eprint.iacr.org/ (2003)

2. Backes, M., Pfitzmann, B.: A general composition theorem for secure reactive systems. In: Theory of Cryptograpy Conference (TCC 2004), LNCS 2951, pp. 336–354 (2004)

3. Backes, M., Cervesato, I., Jaggard, A.D., Scedrov, A., Tsay, J.K.: Cryptographically sound security proofs for basic and public-key kerberos. In: Proceedings 11th European Symposium on Research in Computer Security (2006)

4. Bozga, L., Ene, C., Lacknech, Y.: A symbolic decision procedure for cryptographic protocols with time stamps. J. Log. Algebr. Program. 65, 1–35 (2005)

5. Buldas, A., Laud, P., Saarepera, M., Willemson, J.: Universally composable time-stamping schemes with audit. In: ISC05, LNCS 3650. Cryptology ePrint Archive: Report (2005/198)

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

1. (∈, δ)-Indistinguishable Mixing for Cryptocurrencies;Proceedings on Privacy Enhancing Technologies;2021-11-20

2. A Universally Composable Treatment of Network Time;2017 IEEE 30th Computer Security Foundations Symposium (CSF);2017-08