SETLA: Signature and Encryption from Lattices

DOI10.1007/978-3-030-00434-7_15zbMath1518.94065OpenAlexW2889511457MaRDI QIDQ6104628

Keno Merckx, François Gérard

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)

Related Items (2)

A fully secure lattice-based signcryption with designated equality test in standard model ⋮ A Signcryption Scheme Based Learning with Errors over Rings Without Trapdoor

Cites Work

• Unnamed Item
• On the concrete hardness of learning with errors
• Formal proofs for the security of signcryption
• Security arguments for digital signatures and blind signatures
• Lattice-based signcryption without random oracles
• A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
• Efficient ring-LWE encryption on 8-bit AVR processors
• A lattice-based signcryption scheme without random oracles
• Signcryption with non-interactive non-repudiation
• Lattice Signatures and Bimodal Gaussians
• Lattice Signatures without Trapdoors
• Lattice Cryptography for the Internet
• High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers
• High-Speed Signatures from Standard Lattices
• Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
• Practical Signcryption
• Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
• Advances in Cryptology - EUROCRYPT 2004
• On Ideal Lattices and Learning with Errors over Rings
• An Improved Compression Technique for Signatures Based on Learning with Errors

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