International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs

Authors:
Moni Naor
Asaf Nussboim
Eran Tromer
Download:
DOI: 10.1007/978-3-540-30576-7_5
URL: https://iacr.org/archive/tcc2005/3378_069/3378_069.pdf
Search ePrint
Search Google
Conference: TCC 2005
BibTeX
@inproceedings{tcc-2005-3587,
  title={Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs},
  booktitle={Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005, Proceedings},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={3378},
  pages={66-85},
  url={https://iacr.org/archive/tcc2005/3378_069/3378_069.pdf},
  doi={10.1007/978-3-540-30576-7_5},
  author={Moni Naor and Asaf Nussboim and Eran Tromer},
  year=2005
}