A semantically secure public key cryptoscheme using bit-pair shadows

DOI10.1016/J.TCS.2016.04.017MaRDI QIDQ344780zbMATH OpenOpenAlexFDO

Authors Shenghui Su, Tao Xie, Shuwang Lü, Maozhi Xu

Publication date 24 November 2016

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2016.04.017

zbMATH Keywords

anomalous subset sum problembit-pair shadowcompact sequencepublic key cryptoschemerandom paddingsemantical security

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A public key cryptoscheme using bit-pairs with provable semantical security
• scientific article; zbMATH DE number 2085418
• scientific article; zbMATH DE number 1303131
• Secret public key schemes
• A public key cryptosystem based on three new provable problems

Cites work

• scientific article; zbMATH DE number 1722964 (Why is no real title available?)
• scientific article; zbMATH DE number 177051 (Why is no real title available?)
• scientific article; zbMATH DE number 1302834 (Why is no real title available?)
• scientific article; zbMATH DE number 1302835 (Why is no real title available?)
• scientific article; zbMATH DE number 1304296 (Why is no real title available?)
• scientific article; zbMATH DE number 1349933 (Why is no real title available?)
• scientific article; zbMATH DE number 1088908 (Why is no real title available?)
• scientific article; zbMATH DE number 1842495 (Why is no real title available?)
• scientific article; zbMATH DE number 2123258 (Why is no real title available?)
• scientific article; zbMATH DE number 854547 (Why is no real title available?)
• scientific article; zbMATH DE number 1418967 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A public key cryptosystem based on three new provable problems
• Asymptotic granularity reduction and its application
• Cryptanalysis of short RSA secret exponents
• Hiding information and signatures in trapdoor knapsacks
• Improved low-density subset sum algorithms
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Nonmalleable Cryptography
• Probabilistic encryption
• Solving low density knapsacks

Cited in

(2)

• scientific article; zbMATH DE number 1955805 (Why is no real title available?)
• A public key cryptoscheme using bit-pairs with provable semantical security

This page was built for publication: A semantically secure public key cryptoscheme using bit-pair shadows

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