Provided by: Johns Hopkins University
Date Added: Jul 2013
In this paper, the authors explore building constructions with full domain hash structure, but with standard model proofs that do not employ the random oracle heuristic. The launching point for their results will be the utilization of a \"Leveled\" multi-linear map setting for which Garg, Gentry, and Halevi (GGH) recently gave an approximate candidate. Their first step is the creation of a standard model signature scheme that exhibits the structure of the boneh, lynn and shacham signatures. In particular, this gives them a signature that admits unrestricted aggregation.