A lattice-based signcryption scheme without random oracles

DOI10.1007/S11704-014-3163-1MaRDI QIDQ2515427zbMATH OpenOpenAlexFDO

Authors Xiuhua Lu, Zhengping Jin, Chun-Li Yang, Qiaoyan Wen, Licheng Wang

Publication date 5 August 2015

Published in Frontiers of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11704-014-3163-1

zbMATH Keywords

lattice-based cryptographylearning with errors problemsigncryptionsmall integer solution problemstandard model

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Lattice-based signcryption without random oracles
• Post-quantum secure hybrid signcryption from lattice assumption
• A signcryption scheme based learning with errors over rings without trapdoor
• scientific article; zbMATH DE number 6672421
• Signcryption with quantum random oracles

Cites work

• Advances in Cryptology - CRYPTO 2003
• Bonsai trees, or how to delegate a lattice basis
• Certificateless hybrid signcryption
• Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps
• Efficient lattice (H)IBE in the standard model
• scientific article; zbMATH DE number 1088233 (Why is no real title available?)
• scientific article; zbMATH DE number 1962152 (Why is no real title available?)
• scientific article; zbMATH DE number 1405637 (Why is no real title available?)
• Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
• Lossy trapdoor functions and their applications
• On lattices, learning with errors, random linear codes, and cryptography
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Post-quantum secure hybrid signcryption from lattice assumption
• Public-key cryptosystems from the worst-case shortest vector problem
• The exact security of digital signatures -- how to sign with RSA and Rabin
• The random oracle methodology, revisited.
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

Cited in

(10)

• Signcryption with quantum random oracles
• Lattice-based signcryption without random oracles
• Cryptanalysis of the randomized version of a lattice-based signature scheme from PKC'08
• Construction for a nominative signature scheme from lattice with enhanced security
• Post-quantum secure hybrid signcryption from lattice assumption
• scientific article; zbMATH DE number 6672421 (Why is no real title available?)
• A signcryption scheme based learning with errors over rings without trapdoor
• A selection of recent lattice-based signature and encryption schemes
• SETLA: Signature and Encryption from Lattices
• A fully secure lattice-based signcryption with designated equality test in standard model

This page was built for publication: A lattice-based signcryption scheme without random oracles

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