Public-Key Cryptosystems with Primitive Power Roots of Unity

DOI10.1007/978-3-540-70500-0_8MaRDI QIDQ3511155zbMATH OpenOpenAlexFDO

Authors Takato Hirano, Koichiro Wada, Keisuke Tanaka

Publication date 8 July 2008

Published in Information Security and Privacy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70500-0_8

zbMATH Keywords

factoring assumptionhomomorphismPaillier encryption schemepower roots of unity

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A new public-key cryptosystem as secure as factoring
• scientific article; zbMATH DE number 2086698
• Public-key cryptosystems based on composite degree residuosity classes
• A new public key cryptosystem over \(\mathbb Z_{n^2}^\ast\)
• Progress in Cryptology – Mycrypt 2005

Cites work

• A generalisation, a simplification and some applications of Paillier's probabilistic public-key system
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Efficient public-key cryptosystems provably secure against active adversaries
• scientific article; zbMATH DE number 2043334 (Why is no real title available?)
• scientific article; zbMATH DE number 2204782 (Why is no real title available?)
• Progress in Cryptology – Mycrypt 2005
• Public-key cryptosystems based on composite degree residuosity classes

Cited in

(2)

• New assumptions and efficient cryptosystems from the \(e\)-th power residue symbol
• Public-key cryptosystems based on composite degree residuosity classes

This page was built for publication: Public-Key Cryptosystems with Primitive Power Roots of Unity

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