Entry Gennaro:2006:FPB from tissec.bib

Last update: Sun Oct 15 02:58:48 MDT 2017                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Gennaro:2006:FPB,
  author =       "Rosario Gennaro and Yehuda Lindell",
  title =        "A framework for password-based authenticated key
                 exchange",
  journal =      j-TISSEC,
  volume =       "9",
  number =       "2",
  pages =        "181--234",
  month =        may,
  year =         "2006",
  CODEN =        "ATISBQ",
  DOI =          "https://doi.org/10.1145/1151414.1151418",
  ISSN =         "1094-9224 (print), 1557-7406 (electronic)",
  ISSN-L =       "1094-9224",
  bibdate =      "Sat Aug 26 08:10:38 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/tissec.bib",
  abstract =     "In this paper, we present a general framework for
                 password-based authenticated key exchange protocols, in
                 the common reference string model. Our protocol is
                 actually an abstraction of the key exchange protocol of
                 Katz et al. and is based on the recently introduced
                 notion of smooth projective hashing by Cramer and
                 Shoup. We gain a number of benefits from this
                 abstraction. First, we obtain a modular protocol that
                 can be described using just three high-level
                 cryptographic tools. This allows a simple and intuitive
                 understanding of its security. Second, our proof of
                 security is significantly simpler and more modular.
                 Third, we are able to derive analogs to the Katz et al.
                 protocol under additional cryptographic assumptions.
                 Specifically, in addition to the DDH assumption used by
                 Katz et al., we obtain protocols under both the
                 quadratic and N-residuosity assumptions. In order to
                 achieve this, we construct new smooth projective hash
                 functions.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Information and System Security",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J789",
}

Related entries