Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma-Reference-Cited by-同舟云学术

Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma

Published:2015 Issue: Volume: Page:260-289
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Goyal Vipul,Lin Huijia,Pandey Omkant,Pass Rafael,Sahai Amit

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-46494-6_12

Reference59 articles.

1. Lecture Notes in Computer Science;S. Agrawal,2012

2. Barak, B.: Constant-round coin-tossing with a man in the middle or realizing the shared random string model. In: FOCS (2002)

3. Barak, B., Canetti, R., Nielsen, J.B., Pass, R.: Universally composable protocols with relaxed set-up assumptions. In: Proc.45th FOCS, pp. 186–195 (2004)

4. Beaver, D.: Foundations of secure interactive computing. In: Feigenbaum, J. (ed.) Advances in Cryptology - CRYPT0 1991. LNCS, vol. 576, pp. 377–391. Springer, Heidelberg (1992)

5. Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, pp. 1444–1451 (1987)

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

1. Two-Round Concurrent 2PC from Sub-exponential LWE;Advances in Cryptology – ASIACRYPT 2023;2023

2. Composable Long-Term Security with Rewinding;Theory of Cryptography;2023

3. Post-quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round;Advances in Cryptology – CRYPTO 2022;2022

4. Concurrently Composable Non-interactive Secure Computation;Advances in Cryptology – ASIACRYPT 2022;2022

5. Statistical Concurrent Non-Malleable Zero-Knowledge from One-Way Functions;Journal of Cryptology;2020-04-22