Better Concrete Security for Half-Gates Garbling (in the Multi-instance Setting)-Reference-Cited by-同舟云学术

Better Concrete Security for Half-Gates Garbling (in the Multi-instance Setting)

Published:2020 Issue: Volume: Page:793-822
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2020
language:
Short-container-title:

Author:

Guo Chun,Katz Jonathan,Wang Xiao,Weng Chenkai,Yu Yu

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-56880-1_28

Reference47 articles.

1. Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: 22nd Annual ACM Symposium on Theory of Computing (STOC), pp. 503–513. ACM Press (1990)

2. Lecture Notes in Computer Science;M Bellare,2016

3. Lecture Notes in Computer Science;M Bellare,2000

4. Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A concrete security treatment of symmetric encryption. In: 38th Annual Symposium on Foundations of Computer Science (FOCS), pp. 394–403. IEEE (1997)

5. Bellare, M., Hoang, V.T., Keelveedhi, S., Rogaway, P.: Efficient garbling from a fixed-key blockcipher. In: 2013 IEEE Symposium on Security and Privacy (S&P), pp. 478–492 (2013)

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

1. Efficient Actively Secure DPF and RAM-based 2PC with One-Bit Leakage;2024 IEEE Symposium on Security and Privacy (SP);2024-05-19

2. Fast Evaluation of S-Boxes With Garbled Circuits;IEEE Transactions on Information Forensics and Security;2024

3. Geometry-Based Garbled Circuits Relying Solely on One Evaluation Algorithm Under Standard Assumption;Lecture Notes in Computer Science;2024

4. Time Is Money, Friend! Timing Side-Channel Attack Against Garbled Circuit Constructions;Lecture Notes in Computer Science;2024

5. The Multi-User Constrained Pseudorandom Function Security of Generalized GGM Trees for MPC and Hierarchical Wallets;ACM Transactions on Privacy and Security;2023-06-26