The Generic Hardness of Subset Membership Problems under the Factoring Assumption. Jager, T. & Schwenk, J. IACR Cryptology ePrint Archive, 2008:482, 2008.
The Generic Hardness of Subset Membership Problems under the Factoring Assumption [link]Paper  bibtex   
@article{DBLP:journals/iacr/JagerS08,
  author    = {Tibor Jager and
               J{\"{o}}rg Schwenk},
  title     = {The Generic Hardness of Subset Membership Problems under the Factoring
               Assumption},
  journal   = {{IACR} Cryptology ePrint Archive},
  volume    = {2008},
  pages     = {482},
  year      = {2008},
  url       = {http://eprint.iacr.org/2008/482},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/iacr/JagerS08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0