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

高級(jí)搜索

留言板

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

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

NTRU格上無(wú)證書加密

陳虎 胡予濮

陳虎, 胡予濮. NTRU格上無(wú)證書加密[J]. 電子與信息學(xué)報(bào), 2016, 38(2): 347-353. doi: 10.11999/JEIT150380
引用本文: 陳虎, 胡予濮. NTRU格上無(wú)證書加密[J]. 電子與信息學(xué)報(bào), 2016, 38(2): 347-353. doi: 10.11999/JEIT150380
CHEN Hu, HU Yupu. Certificateless Encryption over NTRU Lattices[J]. Journal of Electronics & Information Technology, 2016, 38(2): 347-353. doi: 10.11999/JEIT150380
Citation: CHEN Hu, HU Yupu. Certificateless Encryption over NTRU Lattices[J]. Journal of Electronics & Information Technology, 2016, 38(2): 347-353. doi: 10.11999/JEIT150380

NTRU格上無(wú)證書加密

doi: 10.11999/JEIT150380
基金項(xiàng)目: 

國(guó)家自然科學(xué)基金(61472309, 61173151),安徽省自然科學(xué)基金(1208085MF108, KJ2012B157)

Certificateless Encryption over NTRU Lattices

Funds: 

The National Natural Science Foundation of China (61472309, 61173151), The Natural Science Foundation of Anhui Province (1208085MF108, KJ2012B157)

  • 摘要: 為降低密鑰尺寸,利用陷門抽樣算法在優(yōu)選的NTRU格上抽取部分私鑰并使用多項(xiàng)式環(huán)上帶誤差的學(xué)習(xí)問(wèn)題計(jì)算公鑰等方法來(lái)構(gòu)造格上無(wú)證書加密方案。它的安全性基于多項(xiàng)式環(huán)上帶誤差學(xué)習(xí)的判定問(wèn)題和小多項(xiàng)式比判定問(wèn)題等兩個(gè)困難問(wèn)題假設(shè)。為獲取更好的效率,該文還提出一個(gè)無(wú)證書并行加密方案。該方案用中國(guó)剩余定理分解擴(kuò)大后的明文空間為多個(gè)不同素理想之積來(lái)實(shí)現(xiàn)并行加密。它還用中國(guó)剩余定理分解加密運(yùn)算所在的多項(xiàng)式環(huán)獲取中國(guó)剩余基來(lái)優(yōu)化算法,使算法只涉及整數(shù)間運(yùn)算。結(jié)果顯示該方案具有計(jì)算和通信復(fù)雜度低等特點(diǎn)。
  • GENTRY C, PEIKERT C, and VAIKUNTANATHAN V. Trapdoors for hard lattices and new cryptographic constructions[C]. Proceedings of the 40th ACM Symposium on Theory of Computing (STOC08), Victoria, Canada, 2008: 197-206. doi: 10.1145/1374376.1374407.
    AGRAWAL S, BONEH D, and BOYEN X. Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE[J]. LNCS, 2010, 6223: 98-115. doi: 10.1007 /978-3-642-14623-7_6.
    DUCAS L, LYUBASHEVSKY V, and PREST T. Efficient identity-based encryption over NTRU lattices[J]. LNCS, 2014, 8874: 22-41. doi: 10.1007/978-3-662-45608-8_2.
    BRAKERSKI Z, GENTRY C, and VAIKUNTANATHAN V. Fully homomorphic encryption without Bootstrapping[C]. Proceedings of the 3rd Innovations in Theoretical Computer Science (ITCS) Conference, Cambridge, Massachusetts, 2012: 309-325.
    LOPEZ-ALT A, TROMER E, and VAIKUNTANATHAN V. On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption[C]. Proceedings of the 44th ACM Symposium on Theory of Computing (STOC12), New York, USA, 2012: 1219-1234. doi: 10.1145/2213977.2214086.
    BRAKERSKI?Z and VAIKUNTANATHAN V.? Lattice- based? FHE?as?secure?as?PKE[C]. Proceedings of the 5rd Innovations in Theoretical Computer Science (ITCS) Conference, Princeton, New Jersey, 2014: 1-12.
    MICCIANCIO D and PEIKERT C. Trapdoor for lattices: simpler, tighter, faster, smaller[J]. LNCS, 2012, 7237: 738-755.
    JARVIS K and NEVINS M. ETRU: NTRU over the Eisenstein integers[J]. Designs, Codes and Cryptography, 2015, 74(1): 219-242.
    BI J G and CHENG Q. Lower bounds of shortest vector lengths in random NTRU lattices[J]. Theoretical Computer Science, 2014, 560(2): 121-130. doi: 10.1007/978-3-642- 29952-0_18.
    SEPAHI R, STEINFELD R, and PIEPRZYK J. Lattice- based certificateless public-key encryption in the standard model[J]. International Journal of Information Security, 2014,?13(4):?315-333. doi: 10.1007/s10207-013-0215-8.
    JIANG Mingming, HU Yupu, LEI Hao, et al. Lattice-based certificateless encryption scheme[J]. Frontiers of Computer Science, 2014,?8(5):?828-836. doi: 10.1007/s11704-014-3187-6.
    AL-RIYAMI S S and PATERSON K G. Certificateless public key cryptography[J]. LNCS, 2003, 2894: 452-473.
    DENT A. A survey of Certificateless encryption schemes and security models[J]. International Journal of Information Security, 2008,?7(5):?347-377. doi: 10.1007/s10207-008-0055-0.
    陳虎, 張福泰, 宋如順. 可證安全的無(wú)證書代理簽名方案[J]. 軟件學(xué)報(bào), 2009, 20(3): 692-701. doi: 10.3724/SP.J.1001.2009. 00574.
    CHEN Hu, ZHANG Futai, and SONG Rushun. Certificateless proxy signature scheme with provable security[J]. Journal of Software, 2009, 20(3): 692-701. doi: 10.3724/SP.J.1001.2009.00574.
    ALWEN J and PEIKERT C. Generating shorter bases for hard random lattices[J]. Theory of Computing Systems, 2011, 48(3): 535-553.
    LYUBASHEVSKY V, PEIKERT C, and REGEV O. On ideal lattices and learning with errors over rings[J]. Journal of the ACM, 2013, 60(6): 43:1-43:35.
    STEHLE D?and STEINFELD R. Making NTRU as secure as worst-case problems over ideal lattices[J]. LNCS, 2011, 6632: 27-47.
    LYUBASHEVSKY V, PEIKERT C, and REGEV O. A toolkit for ring-LWE cryptography[J]. LNCS, 2013, 7881: 35-54.
    LINDNER R and PEIKERT C. Better key sizes (and attacks) for LWE-based encryption[J]. LNCS, 2011, 6558: 319-339. doi: 10.1007/978-3-642-19074-2_21.
  • 加載中
計(jì)量
  • 文章訪問(wèn)數(shù):  1394
  • HTML全文瀏覽量:  156
  • PDF下載量:  531
  • 被引次數(shù): 0
出版歷程
  • 收稿日期:  2015-04-01
  • 修回日期:  2015-11-13
  • 刊出日期:  2016-02-19

目錄

    /

    返回文章
    返回