Fiat-Shamir With Aborts: Applications to Lattice and Factoring-Based Signatures

Download Now
Provided by: Tel Aviv University
Topic: Security
Format: PDF
The authors demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in constructions of the most efficient to-date identification and signature schemes with security based on the worst-case hardness of problems in ideal lattices. In particular, their ID scheme has communication complexity of around 65,000 bits and the length of the signatures produced by their signature scheme is about 50,000 bits.
Download Now

Find By Topic