Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity-Reference-Cited by-同舟云学术

Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity

Published:2016 Issue: Volume: Page:367-399
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Hazay Carmit,Polychroniadou Antigoni,Venkitasubramaniam Muthuramakrishnan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-53641-4_15

Reference58 articles.

1. Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in $$NC^0$$. In: FOCS, pp. 166?175 (2004)

2. Barak, B., Canetti, R., Nielsen, J.B., Pass, R.: Universally composable protocols with relaxed set-up assumptions. In: FOCS, pp. 186?195 (2004)

3. Barak, B., Sahai, A.: How to play almost any mental game over the net - concurrent composition via super-polynomial simulation. In: FOCS, pp. 543?552 (2005)

4. Lecture Notes in Computer Science;D Beaver,1992

5. Boureanu, I., Ohkubo, M., Vaudenay, S.: The limits of composable crypto with transferable setup devices. In: CCS, pp. 381?392 (2015)

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

1. Asterisk: Super-fast MPC with a Friend;2024 IEEE Symposium on Security and Privacy (SP);2024-05-19

2. Everlasting UC Commitments from Fully Malicious PUFs;Journal of Cryptology;2022-07

3. Developing non-interactive MPC with trusted hardware for enhanced security;International Journal of Information Security;2022-03-07

4. Unclonable Polymers and Their Cryptographic Applications;Advances in Cryptology – EUROCRYPT 2022;2022

5. Fully-Secure MPC with Minimal Trust;Theory of Cryptography;2022