Secure Computation Using Leaky Correlations (Asymptotically Optimal Constructions)-Reference-Cited by-同舟云学术

Secure Computation Using Leaky Correlations (Asymptotically Optimal Constructions)

Published:2018 Issue: Volume: Page:36-65
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Block Alexander R.,Gupta Divya,Maji Hemanta K.,Nguyen Hai H.

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-03810-6_2

Reference42 articles.

1. Alon, N., Goldreich, O., Håstad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. In: 31st FOCS, pp. 544–553. IEEE Computer Society Press, October 1990

2. Alon, N., Roichman, Y.: Random cayley graphs and expanders. Random Struct. Algorithms 5(2), 271–284 (1994)

3. Applebaum, B.: Garbled circuits as randomized encodings of functions: a primer. Cryptology ePrint Archive, Report 2017/385 (2017). http://eprint.iacr.org/2017/385

4. Lecture Notes in Computer Science;B Applebaum,2017

5. Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC$$^0$$. In: 45th FOCS, pp. 166–175. IEEE Computer Society Press, October 2004

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

1. Asymptotically Quasi-Optimal Cryptography;Advances in Cryptology – EUROCRYPT 2022;2022

2. Lower Bounds for Leakage-Resilient Secret-Sharing Schemes against Probing Attacks;2021 IEEE International Symposium on Information Theory (ISIT);2021-07-12

3. Leakage-Resilience of the Shamir Secret-Sharing Scheme Against Physical-Bit Leakages;Lecture Notes in Computer Science;2021

4. Secure Computation with Constant Communication Overhead Using Multiplication Embeddings;Progress in Cryptology – INDOCRYPT 2018;2018