Semantically Secure McEliece Phblic-Key Cryptosystem(Special Section on Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
Almost all of the current public-key cryptosystems(PKCs)are based on number theory, such as the integer factoring problem and the discrete logarithm problem(which will be solved in polynomial-time after the emergence of quantum computers). While the McEliece PKC is based on another theory, i.e.coding theory, it is vulnerable against several practical attacks. In this paper, we summarize currently known attacks to the McEliece PKC, and then point, out that, without any decryption oracles or any partial knowledge on the plaintext of the challenge ciphertext, no polynomial-time algorithm is known for inverting the McEliece PKC whose parameters are carefully chosen. Under the assumption that this inverting problem is hard, we propose a slightly modified version of McEliece PKC that can be proven, in the random oracle model, to be semantically secure against adaptive chosen-ciphertext attacks. Our conversion can achieve the reduction of the redundant data down to 1/3-1/4 compared with the generic conversions for practical parameters.
- 社団法人電子情報通信学会の論文
- 2002-01-01
著者
-
Kobara K
Univ. Tokyo Tokyo Jpn
-
Kobara Kazukuni
Information And Systems Institute Of Industrial Science The University Of Tokyo
-
IMAI Hideki
the Institute of Industrial Science, The University of Tokyo
-
Kobara Kazukuni
The Institute Of Industrial Science The University Of Tokyo
-
Kobara Kazukuni
Imai Laboratory Information And Systems Institute Of Industrial Science University Of Tokyo
-
Imai Hideki
The Institute Of Industrial Science The University Of Tokyo
関連論文
- Tradeoffs between Error Performance and Decoding Complexity in Multilevel 8-PSK Codes with UEP Capabilities and Multistage Decoding
- Efficient and Secure Multiparty Generation of Digital Signatures Based on Discrete Logarithms (Special Section on Discrete Mathematics and Its Applications)
- An RSA-Based Leakage-Resilient Authenticated Key Exchange Protocol Secure against Replacement Attacks, and Its Extensions
- Anonymous Password-Authenticated Key Exchange : New Construction and Its Extensions
- A Secure Construction for Threshold Anonymous Password-Authenticated Key Exchange
- A New Security Architecture for Personal Networks and Its Performance Evaluation
- RSA-Based Password-Authenticated Key Exchange, Revisited
- A Secure Authenticated Key Exchange Protocol for Credential Services
- An Efficient and Leakage-Resilient RSA-Based Authenticated Key Exchange Protocol with Tight Security Reduction(Information Security)
- New Security Architecture for Mobile IPv6 Networks
- Notes on Formal Methods Used for Verification of the Security Properties of Protocols Used in Wireless Environment
- A Leakage-Resilient Network Storage System
- Security Analysis of Password-based Protocols via FDR and AVISPA
- A Simple Leakage-Resilient Authenticated Key Establishment Protocol, Its Extensions, and Applications(Information Security)
- An Efficient Leakage-Resilient Authenticated Key Exchange Protocol
- A Secure and Lightweight Authenticated Key Exchange Protocol for Wireless Networks
- Lightweight Privacy-Preserving Authentication Protocols Secure against Active Attack in an Asymmetric Way
- Asymmetric RFID System Secure against Active Attack
- The MAC-based Construction of Strong Multiple Encryption
- Efficient Strong Multiple Encryption from Relaxed Conditions
- ID-based Encryption for Directed Acyclic Graph Hierarchies : Unification of Key-evolving Encryption Primitives (Extended Abstract)
- Shielding Asymmetric Cryptosystems from Decryption Failures
- A Bandwidth-Saving Public Key Encryption Conversion Scheme
- Towards Removing Random Oracles from OAEP
- Asymptotic Bounds for Unidirectional Byte Error-Correcting Codes (Special Section on Information Theory and Its Applications)
- Construction Techniques for Error-Control Runlength-Limited Block Codes
- Cryptanalysis of TOYOCRYPT-HS1 Stream Cipher(Special Section on Cryptography and Information Security)
- Sliced Onion Routing Scheme and its Aptitude for Sender-Identifiable Environments
- A New Anonymous Routing Scheme and its Aptitude for Ad-hoc Networks
- Optimally Mastering Keys in Various Broadcast Encryption Schemes
- An Unconditionally Secure Electronic Cash Scheme with Computational Untraceability(Special Section on Cryptography and Information Security)
- Coded Modulation for Satellite Digital Video Broadcasting (Special Section on Information Theory and Its Applications)
- Semantically Secure McEliece Phblic-Key Cryptosystem(Special Section on Cryptography and Information Security)
- Multi-Dimensional Turbo Codes: Performance and Simplified Decoding Structure
- Security Analysis of Two Augmented Password-Authenticated Key Exchange Protocols
- Reliability-Based Decoding Algorithm in Multistage Decoding of Multilevel Codes(Special Section on Information Theory and Its Applications)
- A Fast Automatic Fingerprint Identification Method Based on a Weighted-Mean of Binary Image (Special Section on Information Theory and Its Applications)
- Viterbi Decoding Considering Synchronization Errors (Special Section on Information Theory and Its Applications)
- Threshold Anonymous Password-Authenticated Key Exchange Secure against Insider Attacks