Universally Composable Oblivious Transfer Based on a Variant of LPN-Reference-Cited by-同舟云学术

Universally Composable Oblivious Transfer Based on a Variant of LPN

Published:2014 Issue: Volume: Page:143-158
ISSN:0302-9743
Container-title:Cryptology and Network Security
language:
Short-container-title:

Author:

David Bernardo,Dowsley Rafael,Nascimento Anderson C. A.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-12280-9_10

Reference43 articles.

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

2. Alekhnovich, M.: More on average case vs approximation complexity. In: 44th FOCS, Cambridge, Massachusetts, USA, October 11-14, pp. 298–307. IEEE Computer Society Press (2003)

3. Alekhnovich, M.: More on average case vs approximation complexity. Computational Complexity 20, 755–786 (2011)

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

5. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd FOCS, Las Vegas, Nevada, USA, October 14-17, pp. 136–145. IEEE Computer Society Press (2001)

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

1. An iterative correction method for practically LPN solving;Information Sciences;2024-09

2. Simple Two-Message OT in the Explicit Isogeny Model;IACR Communications in Cryptology;2024-04-09

3. The Hardness of LPN over Any Integer Ring and Field for PCG Applications;Lecture Notes in Computer Science;2024

4. Zero-Knowledge Systems from MPC-in-the-Head and Oblivious Transfer;Cryptography and Coding;2023-12-04

5. Cryptographic Primitives in Privacy-Preserving Machine Learning: A Survey;IEEE Transactions on Knowledge and Data Engineering;2023