Self-correctors for cryptographic modules

DOI10.1007/978-3-642-25516-8_9MaRDI QIDQ3104690zbMATH OpenOpenAlexFDO

Authors Go Yamamoto, Tetsutaro Kobayashi

Publication date 16 December 2011

Published in Cryptography and Coding (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25516-8_9

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Cryptography (94A60)

Recommendations

• Self-correcting for function fields of finite transcendental degree
• Self-testing/correcting with applications to numerical problems
• Self-correcting polynomial programs
• scientific article; zbMATH DE number 850403
• Correcting subverted random oracles

Cites work

• A simple BGN-type cryptosystem from LWE
• Factoring integers with elliptic curves
• scientific article; zbMATH DE number 1559563 (Why is no real title available?)
• scientific article; zbMATH DE number 1559564 (Why is no real title available?)
• On coherence, random-self-reducibility, and self-correction
• Probabilistic checking of proofs
• Proof verification and the hardness of approximation problems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Robust Characterizations of Polynomials with Applications to Program Testing
• Self-testing/correcting with applications to numerical problems
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
• Theory of Cryptography

Cited in

(1)

• Self-correcting for function fields of finite transcendental degree

This page was built for publication: Self-correctors for cryptographic modules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104690)