Resource-Efficient OT Combiners with Active Security-Reference-Cited by-同舟云学术

Resource-Efficient OT Combiners with Active Security

Published:2017 Issue: Volume: Page:461-486
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Cascudo Ignacio,Damgård Ivan,Farràs Oriol,Ranellucci Samuel

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-70503-3_15

Reference30 articles.

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

2. Beimel, A., Ishai, Y.: On the power of nonlinear secret-sharing. In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, 18–21 June 2001, pp. 188–202 (2001)

3. Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the 1979 AFIPS National Computer Conference, vol. 48, pp. 313–317, June 1979

4. Lecture Notes in Computer Science;M Bellare,1990

5. Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd IEEE Symposium on Foundations of Computer Science, Proceedings. pp. 136–145. IEEE (2001)

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

1. One-out-of-q OT Combiners;IEEE Transactions on Information Theory;2023

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

3. Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer;Advances in Cryptology – CRYPTO 2021;2021

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

5. Secure Computation Using Leaky Correlations (Asymptotically Optimal Constructions);Theory of Cryptography;2018