Symmetric public-key encryption
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Journal of the ACM (JACM)
A new identification scheme based on syndrome decoding
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
McEliece Public Key Cryptosystems Using Algebraic-Geometric Codes
Designs, Codes and Cryptography
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Bit Commitment Using Pseudo-Randomness
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Polynominal time algorithms for discrete logarithms and factoring on a quantum computer
ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Introduction to Coding Theory
Zero-knowledge from secure multiparty computation
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Semantic security for the McEliece cryptosystem without random oracles
Designs, Codes and Cryptography
Oblivious Transfer Based on the McEliece Assumptions
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Coding-Based Oblivious Transfer
Mathematical Methods in Computer Science
Zero-Knowledge Protocols for NTRU: Application to Identification and Proof of Plaintext Knowledge
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Security Bounds for the Design of Code-Based Cryptosystems
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Publicly verifiable secret sharing
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
An efficient pseudo-random generator provably as secure as syndrome decoding
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Efficient and non-malleable proofs of plaintext knowledge and applications
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
A zero-knowledge identification scheme based on the q-ary syndrome decoding problem
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Smaller decoding exponents: ball-collision decoding
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Threshold decryption and zero-knowledge proofs for lattice-based cryptosystems
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Proof of plaintext knowledge for the ajtai-dwork cryptosystem
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
On the inherent intractability of certain coding problems (Corresp.)
IEEE Transactions on Information Theory
Proof of plaintext knowledge for code-based public-key encryption revisited
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
| Hi-index | 0.00 |
We present two zero-knowledge protocols for the code-based McEliece public key encryption scheme in the standard model. Consider a prover who encrypted a plaintext m into a ciphertext c under the public key pk. The first protocol is a proof of plaintext knowledge (PPK), where the prover convinces a polynomially bounded verifier on a joint input (c,pk) that he knows m without actually revealing it. This construction uses code-based Véron's zero-knowledge identification scheme. The second protocol, which builds on the first one, is a verifiable McEliece encryption, were the prover convinces a polynomially bounded verifier on a joint input (c,pk,m) that c is a valid encryption of m, without performing decryption. These protocols are the first PPK and the first verifiable encryption for code-based cryptosystems.