Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More

  • Xavier Boyen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6056)


We propose a framework for adaptive security from hard random lattices in the standard model. Our approach borrows from the recent Agrawal-Boneh-Boyen families of lattices, which can admit reliable and punctured trapdoors, respectively used in reality and in simulation. We extend this idea to make the simulation trapdoors cancel not for a specific forgery but on a non-negligible subset of the possible challenges. Conceptually, we build a compactly representable, large family of input-dependent “mixture” lattices, set up with trapdoors that “vanish” for a secret subset which we hope the forger will target. Technically, we tweak the lattice structure to achieve “naturally nice” distributions for arbitrary choices of subset size. The framework is very general. Here we obtain fully secure signatures, and also IBE, that are compact, simple, and elegant.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Xavier Boyen
    • 1
  1. 1.Institut MontefioreUniversitas LeodiensisLiègeBelgium

Personalised recommendations