%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% Use full name of first author, two letters
% for any other author and two last digits of year.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

@inproceedings{GoldwasserMiRa85,
    author = "S. Goldwasser and S. Micali and C. Rackoff",
    title = "The knowledge complexity of interactive proof-systems",
    booktitle = "Proc.\ $17$th {ACM} Symp.\ on Theory of Computing",
    publisher = "ACM",
    address = "Providence",
    pages = "291--304",
    year = "1985"
}

@PHDTHESIS{Feige90,
  author =       {U. Feige},
  title =        {Alternative Models for Zero Knowledge Interactive Proofs},
  school =       {Department of Computer Science and Applied Mathematics, Weizmann
    Institute of Science, Rehovot, Israel},
  year =         {1990},
}



@Book{Goldreich01book,
  author =       "Oded Goldreich",
  title =        "Foundations of Cryptography: Basic Tools",
  publisher =    "Cambridge University Press",
  address =      "Cambridge, UK",
  pages =        "350 (est.)",
  year =         "2001",
  ISBN =         "0-521-79172-3 (hardback)",
  LCCN =         "????",
  bibdate =      "Mon Sep 17 18:59:16 2001",
  price =        "US\$54.95 (hardback)",
  acknowledgement = ack-nhfb,
}


@InProceedings{Lindell01,
  author =       "Yehuda Lindell",
  title =        "Parallel Coin-Tossing and Constant-Round Secure
                 Two-Party Computation",
  booktitle =    "CRYPTO: Proceedings of Crypto",
  year =         "2001",
}


@Article{FeigeFiSh88,
  author =       "Uriel Feige and Amos Fiat and Adi Shamir",
  title =        "Zero-knowledge proofs of identity",
  journal =      "Journal of Cryptology: the journal of the
                 International Association for Cryptologic Research",
  volume =       "1",
  number =       "2",
  pages =        "77--94",
  year =         "1988",
  coden =        "JOCREQ",
  ISSN =         "0933-2790 (print), 1432-1378 (electronic)",
  mrclass =      "94A60 (68P25 92A25)",
  mrnumber =     "90g:94014",
  bibdate =      "Sat Nov 21 16:36:38 MST 1998",
  acknowledgement = ack-nhfb,
  affiliation =  "Weizmann Inst of Science",
  affiliationaddress = "Rehovot, Isr",
  classification = "723",
  journalabr =   "J Cryptol",
  keywords =     "Cryptography; Data Transmission; Identification
                 Schemes; Interactive Proofs of Knowledge; Secure
                 Communications; Zero-Knowledge Proofs",
}

@ARTICLE{Barak01,
  author =       {Boaz Barak},
  title =        {How to Go Beyond the Black-Box Simulation Barrier},
  journal =      {Proc.\ of the 42nd FOCS, 2001},
  year =         {2001},
}


@InProceedings{FeigeSh89,
  title =        "Zero Knowledge Proofs of Knowledge in Two Rounds",
  author =       "U. Feige and A. Shamir",
  pages =        "526--545",
  booktitle =    "Advances in Cryptology---{CRYPTO}~'89",
  editor =       "G. Brassard",
  series =       "Lecture Notes in Computer Science",
  volume =       "435",
  year =         "1989",
  month =        "20--24~" # aug,
  publisher =    "Springer-Verlag, 1990",
}

@Article{GoldreichMiWi91,
  author =       "Oded Goldreich and Silvio Micali and Avi Wigderson",
  title =        "Proofs that Yield Nothing But Their Validity or All
                 Languages in {NP} Have Zero-Knowledge Proof Systems",
  journal =      "Journal of the Association for Computing Machinery",
  volume =       "38",
  number =       "3",
  pages =        "691--729",
  month =        jul,
  year =         "1991",
  coden =        "JACOAH",
  ISSN =         "0004-5411",
  bibdate =      "Tue Oct 25 11:41:42 1994",
  url =          "http://www.acm.org/pubs/toc/Abstracts/0004-5411/116852.html",
  acknowledgement = ack-nhfb,
  keywords =     "cryptographic protocols; Design; fault-tolerant
                 distributed computing; graph isomorphism; interactive
                 proofs; languages; methodological design of protocols;
                 NP; one-way functions; proof systems; Security; theory;
                 Theory of Computation; Verification; zero-knowledge",
  referencedin = "Referenced in \cite[Ref. 16]{Goldreich:1997:FMCb}.",
  subject =      "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC
                 AND FORMAL LANGUAGES, Mathematical Logic, Proof theory.
                 {\bf E.4}: Data, CODING AND INFORMATION THEORY.",
}

@InProceedings{BrassardCrYu89,
  title =        "Everything in {NP} Can Be Argued in {\emph{Perfect}}
                 Zero-Knowledge in a {\emph{Bounded}} Number of Rounds",
  author =       "Gilles Brassard and Claude Cr{\'e}peau and Moti Yung",
  pages =        "192--195",
  booktitle =    "Advances in Cryptology---{EUROCRYPT}~89",
  editor =       "J.-J. Quisquater and J. Vandewalle",
  year =         "1989",
  month =        "10--13~" # apr,
  series =       "Lecture Notes in Computer Science",
  volume =       "434",
  publisher =    "Springer-Verlag, 1990",
}


@Article{GoldreichKa96,
  title =        "How to Construct Constant-Round Zero-Knowledge Proof
                 Systems for~{NP}",
  author =       "Oded Goldreich and Ariel Kahan",
  pages =        "167--189",
  journal =      "Journal of Cryptology",
  year =         "1996",
  month =        "Summer",
  volume =       "9",
  number =       "3",
  references =   "\cite{STOC::BlumFM1988} \cite{JCRYPT::BoyarKK1990}
                 \cite{JCSS::BrassardCC1988} \cite{TCS::BrassardCY1991}
                 \cite{CRYPTO::FeigeS1989} \cite{JCRYPT::Goldreich1993}
                 \cite{SICOMP::GoldreichK1996}
                 \cite{STOC::GoldreichL1989}
                 \cite{JACM::GoldreichMW1991}
                 \cite{SICOMP::GoldwasserMR1989}
                 \cite{SICOMP::goldwasserMR1988} \cite{STOC::Hastad1990}
                 \cite{STOC::ImpagliazzoLL1989} \cite{STOC::Kilian1992}
                 \cite{FOCS::Kilian1994} \cite{JCRYPT::Naor1991}",
}

@Article{BellareGo93,
  author =       "M. Bellare and O. Goldreich",
  title =        "On Defining Proofs of Knowledge",
  journal =      "Lecture Notes in Computer Science",
  volume =       "740",
  pages =        "390--420",
  year =         "1993",
  coden =        "LNCSD9",
  ISSN =         "0302-9743",
  bibdate =      "Wed Sep 15 10:01:31 MDT 1999",
  acknowledgement = ack-nhfb,
  keywords =     "cryptology; CRYPTO",
}

@TechReport{BarakGoGoLi01,
  author =       "Boaz Barak and Oded Goldreich and Shafi Goldwasser and
                 Yehuda Lindell",
  title =        "Resettably-Sound Zero-Knowledge and its Applications",
  added-by =     "sti",
  url =          "http://eprint.iacr.org/2001/063.ps.gz",
  number =       "2001/063",
  month =        aug,
  keywords =     "foundations / zero-knowledge, resettable
                 zero-knowledge, resettable soundness, proofs of
                 knowledge, public-key model",
  type =         "Record",
  day =          "7",
  year =         "2001",
  institution =  "Cryptology {ePrint} Archive",
  added-at =     "Thu Aug 16 14:10:29 2001",
  note =         "Appeared in 42nd FOCS, 2001",
}


@InProceedings{CanettiGoGoMi00,
  author =       "Ran Canetti and Oded Goldreich and Shafi Goldwasser
                 and Silvio Micali",
  title =        "Resettable Zero-Knowledge",
  added-by =     "sti",
  url =          "http://www.acm.org/pubs/articles/proceedings/stoc/335305/p235-canetti/p235-canetti.pdf",
  annote =       "Resettable = Prover resettable \emph{including} random
                 coins (i.e., only fixed but no updateable state) and
                 arbitrary interleaveable (ie. strictly stronger than
                 concurrent ZKP). Shows that all in NP can be proven,
                 but not in constant rounds (at least for black-box).
                 However, in (bare) public key (ie., everybody/verifier
                 has (at least one and poly-bounded) public key-pair
                 known to the prover prior to \emph{any} interacting
                 (sort of a weak PKI)), constant round protocols are
                 possible. Advantage over CZKP is to redcue physical
                 requirements on HW-device (e.g., SmartCard) but
                 requires that the ``world view'' has to be fixed and
                 frozen into the device at construction! See
                 \cite{MicRey2001} for a strengthening of the bare PK
                 model to achieve 3-round protocols.",
  pages =        "235--244",
  added-at =     "Fri Aug 11 19:17:09 2000",
  booktitle =    "Proceedings of the 32nd Annual Symposium on Theory of
                 Computing ({STOC})",
  year =         "2000",
  month =        may,
  publisher =    "ACM Press",
  address =      "Portland, OR, USA",
}


@Article{FeigeLaSh99,
  author =       "Feige and Lapidot and Shamir",
  title =        "Multiple Noninteractive Zero Knowledge Proofs Under
                 General Assumptions",
  journal =      "SICOMP: SIAM Journal on Computing",
  volume =       "29",
  year =         "1999",
}


@Article{GoldreichKr96,
  author =       "Oded Goldreich and Hugo Krawczyk",
  title =        "On the Composition of Zero-Knowledge Proof Systems",
  journal =      "SIAM Journal on Computing",
  volume =       "25",
  number =       "1",
  pages =        "169--192",
  month =        feb,
  year =         "1996",
  coden =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  mrclass =      "68P25 (68Q15 94A60)",
  mrnumber =     "97b:68051",
  bibdate =      "Sat Dec 5 17:26:53 MST 1998",
  url =          "http://epubs.siam.org/sam-bin/dbq/article/22068",
  acknowledgement = ack-nhfb,
  note =         "Preliminary version appeared in ICALP90, pages
                 268--290.",
}

@TechReport{CanettiKiPeRo01,
  author =       "Ran Canetti and Joe Kilian and Erez Petrank and Alon
                 Rosen",
  title =        "Black-Box Concurrent Zero-Knowledge Requires
                 $\tilde\Omega(\log n)$ Rounds",
  added-by =     "sti",
  url =          "http://eprint.iacr.org/2001/051.ps.gz",
  year =         "2001",
  institution =  "Cryptology {ePrint} Archive",
  number =       "2001/051",
  month =        jun,
  added-at =     "Mon Jun 25 11:22:59 2001",
  type =         "Record",
  note =         "An extended abstract appeared in STOC01.",
}







@InProceedings{CRYPTO::Naor1989,
  title =        "Bit Commitment Using Pseudo-Randomness (Extended
                 Abstract)",
  author =       "Moni Naor",
  pages =        "128--136",
  booktitle =    "Advances in Cryptology---{CRYPTO}~'89",
  editor =       "G. Brassard",
  series =       "Lecture Notes in Computer Science",
  volume =       "435",
  year =         "1989",
  month =        "20--24~" # aug,
  publisher =    "Springer-Verlag, 1990",
}


@Article{Naor91,
  title =        "Bit Commitment Using Pseudorandomness",
  author =       "Moni Naor",
  pages =        "151--158",
  journal =      "Journal of Cryptology",
  year =         "1991",
  volume =       "4",
  number =       "2",
  preliminary =  "CRYPTO::Naor1989",
  references =   "\cite{SICOMP::blumM1984} \cite{JCSS::BrassardCC1988}
                 \cite{CRYPTO::ChaumDG1987} \cite{CRYPTO::FiatS1986}
                 \cite{JACM::GoldreichGM1986}
                 \cite{FOCS::goldreichMW1986}
                 \cite{STOC::goldreichMW1987} \cite{STOC::Hastad1990}
                 \cite{STOC::ImpagliazzoLL1989}
                 \cite{FOCS::ImpagliazzoL1989}
                 \cite{CRYPTO::ImpagliazzoY1987}
                 \cite{IEEETIT::Justesen1972} \cite{FOCS::KilianMO1989}
                 \cite{FOCS::Yao1982}",
}


@InProceedings{FeigeSh90,
  author =       "U. Feige and A. Shamir",
  title =        "Witness indistinguishable and witness hiding
                 protocols",
  editor =       "{ACM}",
  booktitle =    "Proceedings of the 22nd annual {ACM}
                 Symposium on Theory of Computing, Baltimore, Maryland,
                 May 14--16, 1990",
  year =         "1990",
  ISBN =         "0-89791-361-2",
  pages =        "416--426",
  year =         "1990",
  bibdate =      "Wed Apr 4 18:53:16 MDT 2001",
  url =          "http://www.acm.org/pubs/citations/proceedings/stoc/100216/p416-feige/",
  acknowledgement = ack-nhfb,
}


@InProceedings{BabaiFoLeSz91,
  author =       "L. Babai and L. Fortnow and L. A. Levin and M.
                 Szegedy",
  title =        "Checking Computations in Polylogarithmic Time",
  pages =        "21--31",
  ISBN =         "0-89791-397-3",
  editor =       "Baruch Awerbuch",
  booktitle =    "Proceedings of the 23rd Annual {ACM} Symposium on the
                 Theory of Computing",
  address =      "New Orleans, LS",
  month =        may,
  year =         "1991",
  publisher =    "ACM Press",
}


@Article{BabaiFoLu91,
  author =       "L. Babai and L. Fortnow and C. Lund",
  title =        "Nondeterministic Exponential Time has Two-Prover
                 Interactive Protocols",
  journal =      "Computational Complexity",
  volume =       "1",
  number =       "1",
  pages =        "3--40",
  year =         "1991",
  note =         "(Preliminary version in Proc. 31st FOCS.)",
}



@InProceedings{DworkNaSa98,
  author =       "Cynthia Dwork and Moni Naor and Amit Sahai",
  title =        "Concurrent Zero Knowledge",
  pages =        "409--418",
  ISBN =         "0-89791-962-9",
  booktitle =    "Proceedings of the 30th Annual {ACM} Symposium on
                 Theory of Computing ({STOC}-98)",
  month =        may # "~23--26",
  publisher =    "ACM Press",
  address =      "New York",
  year =         "1998",
}

@InProceedings{KilianPeRa98,
  author =       "J. Kilian and E. Petrank and C. Rackoff",
  title =        "Lower bounds for zero knowledge on the {Internet}",
  editor =       "{IEEE}",
  booktitle =    "39th Annual Symposium on Foundations of Computer
                 Science: proceedings: November 8--11, 1998, Palo Alto,
                 California",
  pages =        "484--492",
  year =         "1998",
  bibdate =      "Thu Apr 5 06:13:53 MDT 2001",
  acknowledgement = ack-nhfb,
}



@InProceedings{Rosen00,
  author =       "Alon Rosen",
  title =        "A Note on the Round-Complexity of Concurrent
                 Zero-Knowledge",
  booktitle =    "CRYPTO: Proceedings of Crypto",
  year =         "2000",
}






@InProceedings{AbadiAlBrFeHe88,
  title =        "On Generating Solved Instances of Computational
                 Problems",
  author =       "Mart{\'\i}n Abadi and Eric Allender and Andrei Broder
                 and Joan Feigenbaum and Lane A. Hemachandra",
  pages =        "297--310",
  booktitle =    "Advances in Cryptology---{CRYPTO}~'88",
  editor =       "S. Goldwasser",
  series =       "Lecture Notes in Computer Science",
  volume =       "403",
  year =         "1988",
  month =        "21--25~" # aug,
  publisher =    "Springer-Verlag, 1990",
}


@misc{SudanTrVa98,
    author = {Madhu Sudan and Luca Trevisan and Salil Vadhan},
    title = {Pseudorandom generators without the XOR Lemma},
    howpublished = {ECCC Report TR98-074},
    year = {1998},
    note = {\url{http://www.eccc.uni-trier.de/eccc/}},
}


@Article{AroraLuMoSuSz98,
  title =        "Proof Verification and the Hardness of Approximation
                 Problems",
  author =       "Sanjeev Arora and Carsten Lund and Rajeev Motwani and
                 Madhu Sudan and Mario Szegedy",
  area =         "Formal Languages and Complexity Theory",
  journal =      "Journal of the ACM",
  pages =        "501--555",
  month =        may,
  year =         "1998",
  volume =       "45",
  number =       "3",
  keywords =     "NP-completeness, optimization, proof verification,
                 randomness",
  general-terms = "Algorithms, Theory",
  cr-categories = "F.1.2; F.1.3; F.2.1; F.2.2; F.4.1",
}



@Article{FeigeGoLaSaSz96,
  title =        "Interactive Proofs and the Hardness of Approximating
                 Cliques",
  author =       "Uriel Feige and Shafi Goldwasser and Laszlo Lov{\'a}sz
                 and Shmuel Safra and Mario Szegedy",
  area =         "Formal Languages and Complexity Theory",
  journal =      "Journal of the ACM",
  pages =        "268--292",
  month =        mar,
  year =         "1996",
  volume =       "43",
  number =       "2",
  general-terms = "Algorithms, Theory",
  keywords =     "Hardness of approximation, independent set in a graph,
                 multilinearity testing, \emph{np-completeness},
                 probabilistically checkable proofs",
  cr-categories = "F.1.3[reducibility and completeness \and relations
                 among complexity classes]; F.2.2; G.2.2",
}



@InProceedings{Merkle89,
  author =       "Ralph C. Merkle",
  title =        "A certified digital signature",
  added-by =     "rah",
  annote =       "That antique paper from 1979",
  booktitle =    "Advances in Cryptology -- {CRYPTO} ' 89",
  year =         "1990",
  editor =       "Giles Brassard",
  organization = "International Association for Cryptologic Research",
  publisher =    "Springer-Verlag, Berlin Germany",
  address =      "Santa Barbara, CA, USA",
  series =       "Lecture Notes in Computer Science",
  pages =        "218--238",
}



@Article{Kolmogorov65,
  author =       "A. N. Kolmogorov",
  title =        "Three approaches to the quantitative definition of
                 information",
  journal =      "Problems of Information and Transmission",
  volume =       "1",
  number =       "1",
  pages =        "1--7",
  year =         "1965",
  keywords =     "jrnl, complexity, information theory, inductive
                 inference, II, minimum message length encoding, MML,
                 description, MDL, Chaitin, Solomonoff",
}

@InProceedings{GoldreichLe89,
  author =       "Oded Goldreich and Leonid A. Levin",
  title =        "A Hard-Core Predicate for All One-Way Functions",
  pages =        "25--32",
  booktitle =    "Proceedings of the 21st Annual Symposium on Theory of
                 Computing ({STOC} '89)",
  ISBN =         "0-89791-307-8",
  month =        may,
  publisher =    "ACM Association for Computing Machinery",
  address =      "New York",
  year =         "1989",
}








@Conference{FiatSh86,
  key =          "FS86",
  author =       "Amos Fiat and Adi Shamir",
  title =        "{How to Prove Yourself: Practical Solutions to
                 Identification and Signature Problems}",
  booktitle =    "Proc. CRYPTO'86",
  organization = "LNCS 263",
  pages =        "186--194",
  year =         "1986",
  publisher =    "Springer Verlag",
}





@inproceedings {Blum82,
    AUTHOR = {Blum, Manuel},
     TITLE = {Coin Flipping by Phone},
 BOOKTITLE = {The $24$th IEEE Computer Conference (CompCon)},
     PAGES = {133-137},
      YEAR = {1982},
      NOTE = {See also \emph{SIGACT News}, Vol. 15, No. 1, 1983},
}



@inproceedings {Blum87,
    AUTHOR = {Blum, Manuel},
     TITLE = {How to prove a theorem so no one else can claim it},
 BOOKTITLE = {Proceedings of the International Congress of Mathematicians,
              Vol. 1, 2 (Berkeley, Calif., 1986)},
     PAGES = {1444--1451},
 PUBLISHER = {Amer. Math. Soc.},
   ADDRESS = {Providence, RI},
      YEAR = {1987},
   MRCLASS = {68Q99},
  MRNUMBER = {91h:68141},
}




@InProceedings{Kilian95,
  title =        "Improved Efficient Arguments (Preliminary version)",
  author =       "Joe Kilian",
  pages =        "311--324",
  booktitle =    "Advances in Cryptology---{CRYPTO}~'95",
  editor =       "Don Coppersmith",
  series =       "Lecture Notes in Computer Science",
  volume =       "963",
  year =         "1995",
  month =        "27--31~" # aug,
  publisher =    "Springer-Verlag",
}


@unpublished{BarakGoImRuSaVaYa01,
title="On the (Im)possibility of Obfuscating Programs",
author="B. Barak and O. Goldreich and R. Impagliazzo and
S. Rudich and A. Sahay and S. Vadhan and K. Yang",
year = "2001",
  note =    "To appear in {\em CRYPTO 2001}",
}



@InProceedings{DworkNaReSt99,
  author =       "C. Dwork and M. Naor and O. Reingold and L.
                 Stockmeyer",
  title =        "Magic functions",
  editor =       "{IEEE}",
  booktitle =    "40th Annual Symposium on Foundations of Computer
                 Science: October 17--19, 1999, New York City, New
                 York,",
  publisher =    "IEEE Computer Society Press",
  ISBN =         "0-7695-0409-4 (softbound), 0-7803-5955-0 (casebound),
                 0-7695-0411-6 (microfiche)",
  pages =        "523--534",
  year =         "1999",
  bibdate =      "Thu Apr 5 06:13:53 MDT 2001",
  acknowledgement = ack-nhfb,
}


@misc{KilianPe00,
    author = {Joe Kilian and Erez Petrank},
    title = {Concurrent Zero-Knowledge in Poly-logarithmic Rounds},
    howpublished = {Cryptology ePrint Archive, Report 2000/013},
    year = {2000},
    note = "{\url{http://eprint.iacr.org/}}, an extended abstract appeared in STOC01.",
}


@InProceedings{RichardsonKi99,
  author =       "Richardson and Kilian",
  title =        "On the Concurrent Composition of Zero-Knowledge
                 Proofs",
  booktitle =    "EUROCRYPT: Advances in Cryptology: Proceedings of
                 EUROCRYPT",
  year =         "1999",
}







@misc{HadaTa99,
    author = {Satoshi Hada and Toshiaki Tanaka},
    title = {On the Existence of    3-Round Zero-Knowledge Protocols},
    howpublished = {Cryptology ePrint Archive, Report 1999/009},
    year = {1999},
    note = {\url{http://eprint.iacr.org/}},
}





@InProceedings{Micali94,
  author =       "S. Micali",
  title =        "{CS} proofs",
  editor =       "Shafi Goldwasser",
  booktitle =    "Proceedings: 35th Annual Symposium on Foundations of
                 Computer Science, November 20--22, 1994, Santa Fe, New
                 Mexico",
  publisher =    "IEEE Computer Society Press",
  ISBN =         "0-8186-6582-3",
  pages =        "436--453",
  year =         "1994",
  bibdate =      "Thu Apr 5 06:13:51 MDT 2001",
  acknowledgement = ack-nhfb,
}




@InProceedings{Kilian92,
  author =       "Joe Kilian",
  title =        "A note on efficient zero-knowledge proofs and
                 arguments (extended abstract)",
  editor =       "{ACM}",
  booktitle =    "Proceedings of the 24th annual {ACM}
                 Symposium on Theory of Computing, Victoria, British
                 Columbia, Canada, May 4--6, 1992",
  year =         "1992",
  ISBN =         "0-89791-511-9",
  pages =        "723--732",
  year =         "1992",
  bibdate =      "Wed Apr 4 18:53:17 MDT 2001",
  url =          "http://www.acm.org/pubs/citations/proceedings/stoc/129712/p723-kilian/;
                 http://www.acm.org/pubs/articles/proceedings/stoc/129712/p723-kilian/p723-kilian.pdf",
  acknowledgement = ack-nhfb,
}




@article {GoldwasserMiRa89,
    AUTHOR = {Goldwasser, Shafi and Micali, Silvio and Rackoff, Charles},
     TITLE = {The knowledge complexity of interactive proof systems},
   JOURNAL = {SIAM J. Comput.},
  FJOURNAL = {SIAM Journal on Computing},
    VOLUME = {18},
      YEAR = {1989},
    NUMBER = {1},
     PAGES = {186--208},
      ISSN = {0097-5397},
     CODEN = {SMJCAT},
   MRCLASS = {68T15 (03F07 68Q15 94A60)},
  MRNUMBER = {90f:68157},
MRREVIEWER = {Robert M. Baer},
}






@article {GoldreichGoMi88,
   AUTHOR = {Goldreich, Oded and Goldwasser, Shafi and Micali, Silvio},
    TITLE = {How to construct random functions},
  JOURNAL = {Journal of the Association for Computing Machinery},
   VOLUME = {33},
     YEAR = {1986},
   NUMBER = {4},
    PAGES = {792--807},
     ISSN = {0004-5411},
    CODEN = {JACOAH},
  MRCLASS = {68Q30 (68Q25)},
 MRNUMBER = {88d:68044},
   MRREVR = {P. G{\'a}cs},
}


@Misc{Dorsselaer98,
  OPTcrossref =  "",
  OPTkey =   "",
  author =   "Frans van Dorsselaer",
  title =    "Obsolescent Feature",
  howpublished = "Winning entry for the {\it 1998
          {I}nternational {O}bfuscated {C} {C}ode {C}ontest}",
  year =     "1998",
  OPTmonth =     "",
  note =     "\verb|http://www.ioccc.org/|",
  OPTannote =    ""
}

@article {MR98j:68023,
    AUTHOR = {Goldreich, Oded and Ostrovsky, Rafail},
     TITLE = {Software protection and simulation on oblivious {R}{A}{M}s},
   JOURNAL = {J. ACM},
  FJOURNAL = {Journal of the ACM},
    VOLUME = {43},
      YEAR = {1996},
    NUMBER = {3},
     PAGES = {431--473},
      ISSN = {0004-5411},
   MRCLASS = {68Q05 (68N20 68P25 68Q10)},
  MRNUMBER = {98j:68023},
MRREVIEWER = {William R. Nico}, }

@article {MR98j:68023,
    AUTHOR = {Goldreich, Oded and Ostrovsky, Rafail},
     TITLE = {Software protection and simulation on oblivious {R}{A}{M}s},
   JOURNAL = {J. ACM},
  FJOURNAL = {Journal of the ACM},
    VOLUME = {43},
      YEAR = {1996},
    NUMBER = {3},
     PAGES = {431--473},
      ISSN = {0004-5411},
   MRCLASS = {68Q05 (68N20 68P25 68Q10)},
  MRNUMBER = {98j:68023},
MRREVIEWER = {William R. Nico}, }

@article {GoldreichOs96,
    AUTHOR = {Goldreich, Oded and Ostrovsky, Rafail},
     TITLE = {Software protection and simulation on oblivious {R}{A}{M}s},
   JOURNAL = {Journal of the ACM},
    VOLUME = {43},
      YEAR = {1996},
    NUMBER = {3},
     PAGES = {431--473},
      ISSN = {0004-5411},
   MRCLASS = {68Q05 (68N20 68P25 68Q10)},
  MRNUMBER = {98j:68023},
MRREVIEWER = {William R. Nico}, }

@incollection {RivestAdDe78,
    AUTHOR = {Rivest, Ronald L. and Adleman, Len and Dertouzos, Michael L.},
     TITLE = {On data banks and privacy homomorphisms},
 BOOKTITLE = {Foundations of secure computation (Workshop, Georgia Inst.
              Tech., Atlanta, Ga., 1977)},
     PAGES = {169--179},
 PUBLISHER = {Academic, New York},
      YEAR = {1978},
   MRCLASS = {68A99},
  MRNUMBER = {58 \#25187},
}


@proceedings {FeigenbaumMe89,
     TITLE = {Distributed computing and cryptography},
 BOOKTITLE = {Proceedings of the DIMACS Workshop held in Princeton, New
              Jersey, October 4--6, 1989},
    EDITOR = {Feigenbaum, Joan and Merritt, Michael},
 PUBLISHER = {American Mathematical Society},
   ADDRESS = {Providence, RI},
      YEAR = {1991},
     PAGES = {x+262},
      ISBN = {0-8218-6590-0},
   MRCLASS = {68-06 (68P25 94A60)},
  MRNUMBER = {92b:68006},
}

@article {DolevDwNa00,
    AUTHOR = {Dolev, Danny and Dwork, Cynthia and Naor, Moni},
     TITLE = {Nonmalleable cryptography},
   JOURNAL = {SIAM Journal on Computing},
    VOLUME = {30},
      YEAR = {2000},
    NUMBER = {2},
     PAGES = {391--437 (electronic)},
      ISSN = {1095-7111},
   MRCLASS = {94A60 (68P25)},
  MRNUMBER = {1 769 364},
}

@InProceedings{BonehLi96, title={Algorithms for Black-Box Fields
and their Applications to Cryptography}, author={Dan Boneh and
Richard Lipton}, pages={283--297}, crossref={CRYPTO96} }

@Proceedings{CRYPTO96, title={Advances in
Cryptology---CRYPTO~'96}, booktitle={Advances in
Cryptology---CRYPTO~'96}, editor={M. Wiener}, series=lncs,
volume=1109, year=1996, month=aug, c-address={University of
California, Santa Barbara}, publisher={Springer-Verlag},
crossrefonly=1,
source={http://theory.lcs.mit.edu/~dmjones/hbp/crypto/crypto.bib}
}


@InProceedings{SanderYoYu99, title={Non-interactive
Cryptocomputing for ${\mathrm NC}^1$}, author={Thomas Sander and
Adam Young and Moti Yung}, pages={554--566}, crossref={FOCS40} }

@Proceedings{FOCS40, title={40th Annual Symposium on Foundations
of Computer Science}, booktitle={40th Annual Symposium on
Foundations of Computer Science}, month={17--19 } # oct,
year=1999, address={New York, NY}, organization={IEEE},
crossrefonly=1 }



@InProceedings{BellareRo93,
  author =   "Mihir Bellare and Phillip Rogaway",
  title =    "Random oracles are practical: A paradigm for
 designing efficient protocols",
  OPTcrossref =  "",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  OPTpages =     "",
  booktitle =    "Proceedings of the First Annual Conference on
 Computer and Communications Security",
  year =     "1993",
  organization = "ACM",
  OPTpublisher = "",
  OPTaddress =   "",
  month =    "November",
  OPTnote =      "",
  OPTannote =    ""
}


@InProceedings{CanettiGoHa98,
  author =   "Ran Canetti and Oded Goldreich and Shai Halevi",
  title =    "The Random Oracle Methodology, Revisited",
  crossref =     "STOC30",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "209--218",
  OPTbooktitle = "",
  OPTyear =      "",
  OPTorganization = "",
  OPTpublisher = "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@Proceedings{STOC30, title={Proceedings of the 30th Annual
ACM Symposium on Theory of Computing}, booktitle={Proceedings of
the 30th Annual ACM Symposium on Theory of Computing},
month={23--26 } # may, year=1998, address={Dallas},
c-organization={ACM}, key={ACM}, crossrefonly=1 }


@InProceedings{KatzYu00,
  author =   {Jonathan Katz and Moti Yung},
  title =    {Complete Characterization of Security Notions for
          Private-Key Encryption},
  booktitle =    "Proceedings of the 32nd Annual ACM Symposium on
          Theory of Computing",
  year =     "2000",
  organization = "ACM",
  address =  "Portland, OR",
  month =    "May",
  OPTnote =      {},
  pages =    "245--254"
}

@article {LubyRa88,
    AUTHOR = {Luby, Michael and Rackoff, Charles},
     TITLE = {How to construct pseudorandom permutations from pseudorandom
              functions},
      NOTE = {Special issue on cryptography},
  JOURNAL = {SIAM Journal on Computing},
    VOLUME = {17},
      YEAR = {1988},
    NUMBER = {2},
     PAGES = {373--386},
      ISSN = {0097-5397},
     CODEN = {SMJCAT},
   MRCLASS = {68P25 (65C10 68Q15 68Q25 94A60)},
  MRNUMBER = {89i:68025},
}

@InProceedings{SahaiVa97, title={A Complete Promise Problem for
Statistical Zero-Knowledge}, author={Amit Sahai and Salil P.
Vadhan}, pages={448--457}, crossref={FOCS38},
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib} }

@InProceedings{NaorRe97,
  author =   "Moni Naor and Omer Reingold",
  title =    "Number-theoretic Constructions of Efficient Pseudo-random Functions",
  crossref =     "FOCS38",
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "458--467",
  OPTbooktitle = "",
  OPTyear =      "",
  OPTorganization = "",
  OPTpublisher = "",
  OPTaddress =   "",
  OPTmonth =     "",
  OPTnote =      "",
  OPTannote =    ""
}

@Proceedings{FOCS38, title={38th Annual Symposium on Foundations
of Computer Science}, booktitle={38th Annual Symposium on
Foundations of Computer Science}, month={20--22 } # oct,
year=1997, address={Miami Beach, Florida}, organization={IEEE},
crossrefonly=1, pubinfo={IEEE Computer Society Press Order Number
PR08197; IEEE Order Plan Catalog Number 97CH36130; ISBN
0-8186-8197-7; ISBN 0-8186-8198-5 (case); ISBN 0-8186-8199-3
(microfiche); ISSN 0272-5428},
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib} }

@InProceedings{GoldreichSaVa99, title={Can Statistical
Zero-Knowledge be Made Non-Interactive?, or {O}n the Relationship
of {SZK} and {NISZK}}, author={Oded Goldreich and Amit Sahai and
Salil Vadhan}, pages={}, crossref={CRYPTO99},
source={http://theory.lcs.mit.edu/~dmjones/hbp/crypto/crypto.bib},
note={To appear} }

@Proceedings{CRYPTO99, title={Advances in
Cryptology---CRYPTO~'99}, booktitle={Advances in
Cryptology---CRYPTO~'99}, editor={}, series=lncs, volume={},
year=1999, month={15--19~} # aug, c-address={University of
California, Santa Barbara}, publisher={Springer-Verlag, 1999},
crossrefonly=1,
source={http://theory.lcs.mit.edu/~dmjones/hbp/crypto/crypto.bib}
}

@InProceedings{DeSantisDiPeYu98,
  author =   "{De S}antis, Alfredo and {Di C}rescenzo, Giovanni and
          Giuseppe Persiano and Moti Yung",
  title =    "{I}mage {D}ensity is Complete for Non-interactive-{SZK}",
  crossref =     {ICALP98},
  OPTkey =   "",
  OPTeditor =    "",
  OPTvolume =    "",
  OPTnumber =    "",
  OPTseries =    "",
  pages =    "784--795",
  OPTbooktitle =     {},
  year =     1998,
  OPTorganization = "",
  OPTpublisher = "",
  OPTaddress =   "",
  OPTmonth =     "",
  note =     "See also preliminary draft of full version, May 1999",
  OPTannote =    ""
}








@article {HastadImLeLu99,
   AUTHOR = {H{\aa}stad, Johan and Impagliazzo, Russell and Levin, Leonid A.
             and Luby, Michael},
    TITLE = {A pseudorandom generator from any one-way function},
  JOURNAL = {SIAM Journal on Computing},
   VOLUME = {28},
     YEAR = {1999},
   NUMBER = {4},
    PAGES = {1364--1396 (electronic)},
     ISSN = {1095-7111},
  MRCLASS = {65C10 (68P25 68Q25 94A60)},
 MRNUMBER = {2000b:65010},
   MRREVR = {Francesco Fabris},
}



@InProceedings{ImpagliazzoLu89, title={One-way Functions are
Essential for Complexity Based Cryptography (Extended Abstract)},
author={Impagliazzo, Russell and Luby, Michael}, pages={230--235},
crossref={FOCS30},
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib} }

@Proceedings{FOCS30, title={30th Annual Symposium on Foundations
of Computer Science}, booktitle={30th Annual Symposium on
Foundations of Computer Science}, month={30 } # oct # {--1 } #
nov, year=1989, address={Research Triangle Park, North Carolina},
organization={IEEE}, crossrefonly=1,
source={http://theory.lcs.mit.edu/~dmjones/FOCS/focs.bib} }

@Article{GoldwasserMi84, title={Probabilistic Encryption},
author={Shafi Goldwasser and Silvio Micali}, pages={270--299},
journal={Journal of Computer and System Sciences}, year=1984,
month=apr, volume=28, number=2,
preliminary={STOC::GoldwasserM1982},
source={http://theory.lcs.mit.edu/~dmjones/hbp/jcss/jcss.bib} }





@Proceedings{ICALP98, OPTeditor={}, title={Automata, Languages
and Programming, 25th International Colloquium},
booktitle={Automata, Languages and Programming, 25th International
Colloquium}, address={Aalborg, Denmark}, month={13--17~} # jul,
year=1998, series=lncs, OPTvolume={}, publisher={Springer-Verlag},
OPTcomment={}, crossrefonly=1,
source={http://theory.lcs.mit.edu/~dmjones/hbp/bibs/ley/icalp/icalp.bib}
}

@Proceedings{ICALP90,
editor={Michael S. Paterson},
title={Automata, Languages and Programming, 17th International
Colloquium},
booktitle={Automata, Languages and Programming, 17th International
Colloquium},
address={Warwick University, England},
month={16--20~} # jul,
year=1990,
series=lncs,
volume=443,
publisher={Springer-Verlag},
comment={ISBN 3-540-52826-1},
crossrefonly=1
}