The Uber-Assumption Family
A Unified Complexity Framework for Bilinear Groups

By Xavier Boyen.

In 2nd International Conference on Pairing-based Cryptography (PAIRING 2008), volume 5209 of Lecture Notes in Computer Science, pages 39-56. Springer, 2008.

Invited paper. Presented in London, England, September 2008.

Abstract

We offer an exposition of Boneh, Boyen, and Goh's "uber-assumption" family for analyzing the validity and strength of pairing assumptions in the generic-group model, and augment the original BBG framework with a few simple but useful extensions.

Material

- published paper (PS) (PDF) (also accessible from the publisher) ©
- presentation slides (HTML)

Reference

@InProceedings{Boyen:PAIRING-2008:uber,
  author = {Xavier Boyen},
  title = {The Uber-Assumption Family -- A Unified Complexity Framework for Bilinear Groups},
  booktitle = {2nd International Conference on Pairing-based Cryptography---PAIRING 2008},
  series = {Lecture Notes in Computer Science},
  volume = {5209},
  pages = {39--56},
  publisher = {Berlin: Springer-Verlag},
  year = {2008},
  note = {Available at \url{http://www.cs.stanford.edu/~xb/pairing08/}}
}