A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security

DOI10.1007/978-3-319-21398-9_53zbMath1465.94089arXiv1408.6226OpenAlexW2293486183MaRDI QIDQ3196425

Lü, Shuwang, Shenghui Su, Mao-Zhi Xu

Publication date: 29 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.6226

zbMATH Keywords

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• A public key cryptosystem based on three new provable problems
• Probabilistic encryption
• Improved low-density subset sum algorithms
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A method for obtaining digital signatures and public-key cryptosystems
• Nonmalleable Cryptography
• Solving Low Density Knapsacks
• Hiding information and signatures in trapdoor knapsacks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security