Self-correctors for cryptographic modules

Authors:
Go Yamamoto;Tetsutaro Kobayashi
Affiliations:
NTT Information Sharing Platform Laboratories, Japan;NTT Information Sharing Platform Laboratories, Japan
Venue:
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Year:
2011

Citing 16
Cited 0

Non-interactive zero-knowledge and its applications

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A hard-core predicate for all one-way functions

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Self-testing/correcting with applications to numerical problems

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Self-testing/correcting for polynomials and for approximate functions

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved low-degree testing and its applications

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Probabilistic checking of proofs: a new characterization of NP

Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
On Coherence, random-self-reducibility, and self-correction

Computational Complexity
The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms

SIAM Journal on Computing
Robust Characterizations of Polynomials withApplications to Program Testing

SIAM Journal on Computing
Lower bounds for discrete logarithms and related problems

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Hidden pairings and trapdoor DDH groups

ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
How to securely outsource cryptographic computations

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
A simple BGN-Type cryptosystem from LWE

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

A self-corrector for a function f is an efficient machine that computes f correctly using any untrusted black-box that computes f correctly only with a certain probability. The design of self-correctors for non-verifiable functions, typically decryption functions of public-key cryptographies, was investigated. We present a design method for self-correctors that works even when the black-box returns correct output with probability of less than 1/2. For a practical demonstration of the method, we also present examples of self-correctors for the decryption functions of public-key cryptosystems, such as the ElGamal, the Pailler, and the GHV cryptosystems, and for hidden pairings with trapdoors.