Semi-Generic Groups and Their Applications

Tibor Jager

Chapter 6 in Black-Box Models of Computation in Cryptology, 2012, pp 57-75 from Springer

Abstract: Abstract The generic group model (GGM) is used frequently to provide evidence towards newly introduced hardness assumptions. In particular in the area of pairing-based cryptography numerous novel assumptions have been introduced over the last decade. Unfortunately, the GGM does not reflect many known properties of bilinear group settings. Not at least currently known algorithms for solving computational problems over bilinear groups are captured, and thus hardness results in this model are of limited significance.

Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-8348-1990-1_6

Ordering information: This item can be ordered from
http://www.springer.com/9783834819901

DOI: 10.1007/978-3-8348-1990-1_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().