一级黄色片免费播放|中国黄色视频播放片|日本三级a|可以直接考播黄片影视免费一级毛片

高級搜索

留言板

尊敬的讀者、作者、審稿人, 關(guān)于本刊的投稿、審稿、編輯和出版的任何問題, 您可以本頁添加留言。我們將盡快給您答復(fù)。謝謝您的支持!

姓名
郵箱
手機(jī)號碼
標(biāo)題
留言內(nèi)容
驗證碼

基于列表譯碼方法在查詢訪問模型下含錯學(xué)習(xí)問題的分析

王明強(qiáng) 莊金成

王明強(qiáng), 莊金成. 基于列表譯碼方法在查詢訪問模型下含錯學(xué)習(xí)問題的分析[J]. 電子與信息學(xué)報, 2020, 42(2): 322-326. doi: 10.11999/JEIT190624
引用本文: 王明強(qiáng), 莊金成. 基于列表譯碼方法在查詢訪問模型下含錯學(xué)習(xí)問題的分析[J]. 電子與信息學(xué)報, 2020, 42(2): 322-326. doi: 10.11999/JEIT190624
Mingqiang WANG, Jincheng ZHUANG. Analysis of Learning With Errors in Query Access Model: A List Decoding Approach[J]. Journal of Electronics & Information Technology, 2020, 42(2): 322-326. doi: 10.11999/JEIT190624
Citation: Mingqiang WANG, Jincheng ZHUANG. Analysis of Learning With Errors in Query Access Model: A List Decoding Approach[J]. Journal of Electronics & Information Technology, 2020, 42(2): 322-326. doi: 10.11999/JEIT190624

基于列表譯碼方法在查詢訪問模型下含錯學(xué)習(xí)問題的分析

doi: 10.11999/JEIT190624
基金項目: 國家自然科學(xué)基金(61672019)
詳細(xì)信息
    作者簡介:

    王明強(qiáng):男,1970年生,教授,研究方向為算法數(shù)論和公鑰密碼學(xué)

    莊金成:男,1987年生,教授,研究方向為算法數(shù)論和公鑰密碼學(xué)

    通訊作者:

    莊金成 jzhuang@sdu.edu.cn

  • 中圖分類號: TN918; TP309

Analysis of Learning With Errors in Query Access Model: A List Decoding Approach

Funds: The National Natural Science Foundation of China (61672019)
  • 摘要: Regev在2005年提出了含錯學(xué)習(xí)問題(LWE),這個問題與隨機(jī)線性碼的譯碼問題密切相關(guān),并且在密碼學(xué)特別是后量子密碼學(xué)中應(yīng)用廣泛。原始的含錯學(xué)習(xí)問題是在隨機(jī)訪問模型下提出的,有證據(jù)證明該問題的困難性。許多研究者注意到的一個事實是當(dāng)攻擊者可以選擇樣本時,該問題是容易的。但是目前據(jù)作者所知并沒有一個完整的求解算法。該文分析了查詢訪問模型下的帶有錯誤學(xué)習(xí)問題,給出了完整的求解算法。分析采用的工具是將該問題聯(lián)系到隱藏數(shù)問題,然后應(yīng)用傅里葉學(xué)習(xí)算法進(jìn)行列表譯碼。
  • KEARNS M J and VAZIRANI U V. An Introduction to Computational Learning Theory[M]. Cambridge, London England: The MIT Press, 1994.
    BLUM A, KALAI A, and WASSERMAN H. Noise-tolerant learning, the parity problem, and the statistical query model[J]. Journal of the ACM, 2003, 50(4): 506–519. doi: 10.1145/792538.792543
    PIETRZAK K. Cryptography from learning parity with noise[C]. The 38th International Conference on Current Trends in Theory and Practice of Computer Science, ?pindler?v Mlyn, Czech Republic, 2012: 99–114.
    REGEV O. On lattices, learning with errors, random linear codes, and cryptography[C]. The 37th Annual ACM Symposium on Theory of Computing, Baltimore, USA, 2005: 84–93.
    BONEH D and VENKATESAN R. Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes[C]. The 16th Annual International Cryptology Conference on Advances in Cryptology, Santa Barbara, USA, 1996: 129–142.
    GALBRAITH S D and SHANI B. The multivariate hidden number problem[C]. The 8th International Conference on Information Theoretic Security, Lugano, Switzerland, 2015: 250–268.
    GOLDREICH O and LEVIN L A. A hard-core predicate for all one-way functions[C]. The 21st Annual ACM Symposium on Theory of Computing, Seattle, USA, 1989: 25–32.
    KUSHILEVITZ E and MANSOUR Y. Learning decision trees using the Fourier spectrum[C]. The 23rd Annual ACM Symposium on Theory of Computing, New Orleans, USA, 1991: 455–464.
    AKAVIA A, GOLDWASSER S, and SAFRA S. Proving hard-core predicates using list decoding[C]. The 44th Annual IEEE Symposium on Foundations of Computer Science, Cambridge, USA, 2003: 146–157.
    GALBRAITH S D, LAITY J, and SHANI B. Finding significant Fourier coefficients: Clarifications, simplifications, applications and limitations[J]. Chicago Journal of Theoretical Computer Science, 2018, 6: 1–38.
    AKAVIA A. Solving hidden number problem with one bit oracle and advice[C]. The 29th Annual International Cryptology Conference on Advances in Cryptology, Santa Barbara, USA, 2009: 337–354.
    MICCIANCIO D and MOL P. Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions[C]. The 31st Annual Conference on Advances in Cryptology, Santa Barbara, USA, 2011: 465–484.
  • 加載中
計量
  • 文章訪問數(shù):  1746
  • HTML全文瀏覽量:  896
  • PDF下載量:  70
  • 被引次數(shù): 0
出版歷程
  • 收稿日期:  2019-08-14
  • 修回日期:  2019-12-05
  • 網(wǎng)絡(luò)出版日期:  2019-12-09
  • 刊出日期:  2020-02-19

目錄

    /

    返回文章
    返回