IBM，機密をä¿ã£ãŸã¾ã¾æš—å·åŒ–データを処ç†ã™ã‚‹æŠ€è¡“を開発
ç±³IBMã¯ç±³å›½æ™‚é–“2009å¹´6月25日，公開éµæ–¹å¼ã§æš—å·åŒ–ã•ã‚ŒãŸãƒ‡ãƒ¼ã‚¿ã‚’復å·ã›ãšã«æ©Ÿå¯†æ€§ã‚’ç¶æŒã—ãŸã¾ã¾å‡¦ç†ã§ãる手法を開発ã—ãŸã€‚データã®å†…容を知るã“ã¨ãªãã•ã¾ã–ã¾ãªå‡¦ç†ãŒè¡Œãˆã‚‹ãŸã‚，クラウド・コンピューティング環境ã¸ã®ä¿å˜ã‚„å„種分æžï¼ã‚¹ãƒ‘ム・フィルタリングãªã©ã‚’æ–½ã—ã¦ã‚‚æƒ…å ±ã‚»ã‚ュリティを確ä¿ã§ãã‚‹ã¨ã—ã¦ã„る。 ã“ã®æ‰‹æ³•ã¯ï¼Œå…¬é–‹éµæ–¹å¼ã®æš—å·æŠ€è¡“ãŒè€ƒæ¡ˆã•ã‚Œã¦ä»¥æ¥ï¼Œé›£å•ã¨ã•ã‚Œã¦ã„ãŸã€Œprivacy homomorphism（準åŒåž‹æš—å·ï¼‰ã€ï¼ˆåˆ¥å「fully homomorphic encryptionã€ï¼ˆå®Œå…¨æº–åŒåž‹æš—å·ï¼‰ã‚’実ç¾ã™ã‚‹ã‚‚ã®ã€‚åŒç¤¾ã®ç ”究者ã¯ã€Œã‚¤ãƒ‡ã‚¢ãƒ«æ ¼åã€ã¨å‘¼ã°ã‚Œã‚‹æ•°å¦çš„手法を用ã„，暗å·åŒ–データã®æ©Ÿå¯†æ€§ã‚’æãªã†ã“ã¨ãªãæƒ…å ±ã‚’è‡ªç”±ã«åˆ†æžã§ãるよã†ã«ã—ãŸã¨ã„ã†ã€‚ 例ãˆã°ã‚¯ãƒ©ã‚¦ãƒ‰ãƒ»ã‚³ãƒ³ãƒ”ューティング・サービスを手ãŒã‘ã‚‹ä¼æ¥ã¯ï¼Œé¡§å®¢ã‹ã‚‰é ã‹ã£ãŸãƒ‡ãƒ¼ã‚¿ã‚’æš—å·åŒ–ã—ãŸã¾ã¾ä¿å˜ã—ã¦è²©å£²ãƒ‘ターン分æžã‚’æ–½
IBM's Blindfolded Calculator
The computer science problems that earned Craig Gentry his job at IBM sound a bit like Zen koans. Could Google search the Web without knowing what it was looking for? Can an e-mail filter identify spam without reading it? Could an official count votes in an election without opening a ballot? Those privacy puzzles, as Gentry has shown in an unpublished Ph.D. dissertation, aren't as paradoxical as t
ランã‚ング
ãŠçŸ¥ã‚‰ã›
ランã‚ング
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
SpringerLink - Book Chapter - PKC 2010 - Xavier Boyen "Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More"
Cryptology ePrint Archive: Report 2010/088 - C. Peikert "An Efficient and Parallel Gaussian Sampler for Lattices"
Cryptology ePrint Archive: Report 2010/288 - J. Wang, J. Bi "Lattice-based Identity-Based Broadcast Encryption Scheme"
http://www.cosic.esat.kuleuven.be/publications/article-1287.pdf
Cryptology ePrint Archive 2009/391 - R. Bendlin, I. Damgård "Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems"
ECCC - TR09-065 - P. Voulgaris, D. Micciancio "Faster exponential time algorithms for the shortest vector problem"
Cryptology ePrint Archive 2009/337 - Y. Pan, Y. Deng, Y. Jiang, Z. Tu "A New Lattice-Based Cryptosystem Mixed with a Knapsack"
The $n^c$-Unique Shortest Vector Problem is Hard
Cryptology ePrint Archive 2008/493 - Johannes Buchmann and Richard Lindner "Secure Parameters for SWIFFT"
Cryptology ePrint Archive 2008/366 - T. Q. Khoat, H. T. Nguyen "Unique Shortest Vector Problem for max norm is NP-hard"
Cryptology ePrint Archive 2008/322 M. Rückert "Efficient Quantum-immune Blind Signatures"
Explicit hard instances of the shortest vector problem
Cryptology ePrint Archive 2008/315 - S. Sarkar, S. Maitra, S. Sarkar "RSA Cryptanalysis with Increased Bounds on the Secret Exponent using Less Lattice Dimension"
Cryptology ePrint Archive 2008/204 - Y. Pan, Y. Deng "Cryptanalysis of the Cai-Cusick Lattice-based Public-key Cryptosystem"
Cryptology ePrint Archive 2007/446 - C. Aguilar Melchor, P. Gaborit "A Lattice-Based Computationally-Efficient Private Information Retrieval Protocol"
Cryptology ePrint Archive 2007/445 - Gerold Grünauer "Proposal of a new efficient public key system for encryption and digital signatures"
Cryptology ePrint Archive 2007/432 - C. Gentry, C. Peikert, V. Vaikuntanathan "Trapdoors for Hard Lattices and New Cryptographic Constructions"
Cryptology ePrint Archive 2007/423 - L. El Aimani, J. von zur Gathen "Finding Low Weight Polynomial Multiples Using Lattices"
{{#tags}}- {{label}}
{{/tags}}