SETLA: Signature and Encryption from Lattices

DOI10.1007/978-3-030-00434-7_15MaRDI QIDQ6104628zbMATH OpenOpenAlexFDO

Authors François Gérard, Keno Merckx

Publication date 28 June 2023

Published in Cryptology and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-00434-7_15

zbMATH Keywords

random oracle modelsigncryption schemes

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• A selection of recent lattice-based signature and encryption schemes
• scientific article; zbMATH DE number 6672421
• Practical lattice-based cryptography: \texttt{NTRUEncrypt} and \texttt{NTRUSign}
• Asymptotically Efficient Lattice-Based Digital Signatures
• Asymptotically efficient lattice-based digital signatures
• Application of the lattice theory to the analysis of digital signature schemes
• scientific article; zbMATH DE number 7108581
• Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
• A lattice-based McEliece scheme for encryption and signature
• Lattice-based signcryption without random oracles

Cites work

• A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
• A lattice-based signcryption scheme without random oracles
• Advances in Cryptology - EUROCRYPT 2004
• An improved compression technique for signatures based on learning with errors
• Efficient ring-LWE encryption on 8-bit AVR processors
• Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
• Formal proofs for the security of signcryption
• High-performance ideal lattice-based cryptography on 8-bit ATxmega microcontrollers
• High-speed signatures from standard lattices
• scientific article; zbMATH DE number 1088233 (Why is no real title available?)
• Lattice cryptography for the internet
• Lattice signatures and bimodal Gaussians
• Lattice signatures without trapdoors
• Lattice-based signcryption without random oracles
• On ideal lattices and learning with errors over rings
• On the concrete hardness of learning with errors
• Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
• Practical Signcryption
• Security arguments for digital signatures and blind signatures
• Signcryption with non-interactive non-repudiation

Cited in

(6)

• Revisiting TESLA in the quantum random oracle model
• LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding
• SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
• Post-quantum secure hybrid signcryption from lattice assumption
• A signcryption scheme based learning with errors over rings without trapdoor
• A fully secure lattice-based signcryption with designated equality test in standard model

This page was built for publication: SETLA: Signature and Encryption from Lattices

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