Concurrently Composable Security with Shielded Super-Polynomial Simulators-Reference-Cited by-同舟云学术

Concurrently Composable Security with Shielded Super-Polynomial Simulators

Published:2017 Issue: Volume: Page:351-381
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Broadnax Brandon,Döttling Nico,Hartung Gunnar,Müller-Quade Jörn,Nagel Matthias

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-56620-7_13

Reference44 articles.

1. Lecture Notes in Computer Science;B Aiello,2001

2. Barak, B., et al.: Universally composable protocols with relaxed set-up assumptions. In: 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004, pp. 186–195. IEEE (2004)

3. Lecture Notes in Computer Science;D Boneh,2004

4. Blum, M.: Coin flipping by telephone. In: Advances in Cryptology, CRYPTO 1981: IEEE Workshop on Communications Security. University of California, Santa Barbara, Department of Electrical and Computer Engineering, pp. 11–15 (1981)

5. Barak, B., Sahai, A.: How to play almost any mental game over the net - concurrent composition via super-polynomial simulation. In: 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005, pp. 543–552. IEEE (2005)

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

1. A New Approach to Post-Quantum Non-Malleability;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. A New Approach to Efficient Non-Malleable Zero-Knowledge;Advances in Cryptology – CRYPTO 2022;2022

3. Fortified Multi-Party Computation: Taking Advantage of Simple Secure Hardware Modules;Proceedings on Privacy Enhancing Technologies;2021-07-23

4. Adaptive Security of Multi-party Protocols, Revisited;Theory of Cryptography;2021

5. Environmentally Friendly Composable Multi-party Computation in the Plain Model from Standard (Timed) Assumptions;Theory of Cryptography;2021