Efficient Authentication from Hard Learning Problems-Reference-Cited by-同舟云学术

Efficient Authentication from Hard Learning Problems

Published:2011 Issue: Volume: Page:7-26
ISSN:0302-9743
Container-title:Advances in Cryptology – EUROCRYPT 2011
language:
Short-container-title:

Author:

Kiltz Eike,Pietrzak Krzysztof,Cash David,Jain Abhishek,Venturi Daniele

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-20465-4_3.pdf

Reference31 articles.

1. The full version of this paper will be posted on the Cryptology ePrint Archive, http://eprint.iacr.org/

2. Lecture Notes in Computer Science;S. Agrawal,2010

3. Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory 24(3), 384–386 (1978)

4. Lecture Notes in Computer Science;A. Blum,1994

5. Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. In: 32nd ACM STOC, pp. 435–440. ACM Press, New York (May 2000)

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

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

2. A Lightweight Identification Protocol Based on Lattices;Lecture Notes in Computer Science;2023

3. Lightweight Authentication Using Noisy Key Derived from Physically Unclonable Function;Innovative Security Solutions for Information Technology and Communications;2023

4. Statistically Sender-Private OT from LPN and Derandomization;Advances in Cryptology – CRYPTO 2022;2022

5. Authentication in the Bounded Storage Model;Advances in Cryptology – EUROCRYPT 2022;2022