Black-Box Models of Computation

Tibor Jager

Chapter 2 in Black-Box Models of Computation in Cryptology, 2012, pp 5-13 from Springer

Abstract: Abstract Several abstract models of computation have been proposed in the literature to capture the notion of “generic groups” or their extensions [BS84, Nec94, Sho97, Mau05]. The black-box model we are going to describe in the sequel is a generalization of the model introduced by Maurer in [Mau05], which in turn can be seen as a generalization of the model of [Sho97]. While Maurer's model captures only the case where a generic algorithm operates on elements of a single algebraic structure, like a group or a ring, we extend this model in order to be able to describe settings where more than one algebraic structure is considered, as in pairing-based cryptography [DBS04], for instance.

Keywords: Random Oracle; Discrete Logarithm; Discrete Logarithm Problem; Random String; Simulation Game (search for similar items in EconPapers)
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_2

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

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

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 ().