%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "1.01",
%%%     date            = "13 March 2015",
%%%     time            = "13:05:41 MST",
%%%     filename        = "lncs2014a.bib",
%%%     address         = "University of Utah
%%%                        Department of Mathematics, 110 LCB
%%%                        155 S 1400 E RM 233
%%%                        Salt Lake City, UT 84112-0090
%%%                        USA",
%%%     telephone       = "+1 801 581 5254",
%%%     FAX             = "+1 801 581 4148",
%%%     URL             = "http://www.math.utah.edu/~beebe",
%%%     checksum        = "46556 641 2484 29624",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                        beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "BibTeX; bibliography; Lecture Notes in
%%%                        Computer Science",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "This is a bibliography of papers published in
%%%                        Lecture Notes in Computer Science
%%%                        (Springer-Verlag) for 2014 for volumes in
%%%                        the range 8349--??.
%%%
%%%                        Bibliography entries below treat the series
%%%                        as a journal, rather than as conference
%%%                        proceedings.  Article entries normally contain
%%%                        DOI and/or URL values that lead to online
%%%                        access to the article text, and book-DOI and/or
%%%                        book-URL values that lead to the conference
%%%                        proceedings volume, or monograph, in which the
%%%                        article appears.
%%%
%%%                        The companion bibliography lncs.bib lists
%%%                        just the individual volumes in the series,
%%%                        and the lncswxyz*.bib files list individual
%%%                        papers for specified volume ranges in year
%%%                        wxyz.  The large number of papers in this
%%%                        collection, and limitations in TeX and
%%%                        BibTeX, and in WWW HTTP transfer speeds,
%%%                        necessitate the splitting of the papers
%%%                        bibliographies into several separate files
%%%                        for each year.
%%%
%%%                        At version 1.01, the year coverage looked
%%%                        like this:
%%%
%%%                             2014 (  21)
%%%
%%%                             Article:         21
%%%
%%%                             Total entries:   21
%%%
%%%                        This bibliography has been constructed
%%%                        primarily from the publisher Web site.
%%%
%%%                        Numerous errors in the sources noted above
%%%                        have been corrected.  Spelling has been
%%%                        verified with the UNIX spell and GNU ispell
%%%                        programs using the exception dictionary
%%%                        stored in the companion file with extension
%%%                        .sok.
%%%
%%%                        BibTeX citation tags are uniformly chosen as
%%%                        name:year:abbrev, where name is the family
%%%                        name of the first author or editor, year is a
%%%                        4-digit number, and abbrev is a 3-letter
%%%                        condensation of important title words.
%%%                        Citation labels were automatically generated
%%%                        by software developed for the BibNet Project.
%%%
%%%                        In this bibliography, entries are sorted in
%%%                        publication order, with the help of ``bibsort
%%%                        -bypages''.  The bibsort utility is available
%%%                        at
%%%
%%%                            http://www.math.utah.edu/pub/bibsort
%%%
%%%                        The checksum field above contains a CRC-16
%%%                        checksum as the first value, followed by the
%%%                        equivalent of the standard UNIX wc (word
%%%                        count) utility output of lines, words, and
%%%                        characters.  This is produced by Robert
%%%                        Solovay's checksum utility.",
%%%  }
%%% ====================================================================

@Preamble{
    "\ifx \undefined \bbb \def \bbb #1{\mathbb{#1}} \fi" #
    "\ifx \undefined \circled  \def \circled #1{(#1)}\fi" #
    "\ifx \undefined \k        \let \k = \c \fi" #
    "\ifx \undefined \mathbb   \def \mathbb #1{{\bf #1}}\fi" #
    "\ifx \undefined \mathcal  \def \mathcal #1{{\cal #1}}\fi" #
    "\ifx \undefined \mathrm   \def \mathrm #1{{\rm #1}}\fi" #
    "\ifx \undefined \ocirc    \def \ocirc #1{{\accent'27#1}}\fi" #
    "\ifx \undefined \reg      \def \reg {\circled{R}}\fi" #
    "\ifx \undefined \TM       \def \TM {${}^{\sc TM}$} \fi" #
    "\hyphenation{
        An-iso-tro-pic
        Ay-ka-nat
        Giun-chi-glia
        Lakh-neche
        Mal-er-ba
        Mart-el-li
        Reut-e-nau-er
        Thiel-sch-er
        Zheng-zhou
        }"
}

%%% ====================================================================
%%% Acknowledgement abbreviations:

@String{ack-nhfb = "Nelson H. F. Beebe,
                    University of Utah,
                    Department of Mathematics, 110 LCB,
                    155 S 1400 E RM 233,
                    Salt Lake City, UT 84112-0090, USA,
                    Tel: +1 801 581 5254,
                    FAX: +1 801 581 4148,
                    e-mail: \path|beebe@math.utah.edu|,
                            \path|beebe@acm.org|,
                            \path|beebe@computer.org| (Internet),
                    URL: \path|http://www.math.utah.edu/~beebe/|"}

%%% ====================================================================
%%% Journal abbreviations:

@String{j-LECT-NOTES-COMP-SCI   = "Lecture Notes in Computer Science"}

%%% ====================================================================
%%% Publisher abbreviations:

@String{pub-SV                  = "Springer-Verlag Inc."}
@String{pub-SV:adr              = "New York, NY, USA"}

%%% ====================================================================
%%% Series abbreviations:

@String{ser-LNAI                = "Lecture Notes in Artificial Intelligence"}

@String{ser-LNCS                = "Lecture Notes in Computer Science"}

%%% ====================================================================
%%% Bibliography entries: entries are sorted in publication order with
%%% `bibsort -bypages':

@Article{Brakerski:2014:VBB,
  author =       "Zvika Brakerski and Guy N. Rothblum",
  title =        "Virtual Black-Box Obfuscation for All Circuits via
                 Generic Graded Encoding",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "8349",
  pages =        "1--25",
  year =         "2014",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-642-54242-8_1",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Aug 21 08:39:11 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_1/;
                 http://link.springer.com/content/pdf/bfm:978-3-642-54242-8/1.pdf",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-642-54242-8",
  book-URL =     "http://www.springerlink.com/content/978-3-642-54242-8",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Barak:2014:OEF,
  author =       "Boaz Barak and Nir Bitansky and Ran Canetti and Yael
                 Tauman Kalai and Omer Paneth and Amit Sahai",
  title =        "Obfuscation for Evasive Functions",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "8349",
  pages =        "26--51",
  year =         "2014",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-642-54242-8_2",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Aug 21 08:39:11 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_2/",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-642-54242-8",
  book-URL =     "http://www.springerlink.com/content/978-3-642-54242-8",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Boyle:2014:EO,
  author =       "Elette Boyle and Kai-Min Chung and Rafael Pass",
  title =        "On Extractability Obfuscation",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "8349",
  pages =        "52--73",
  year =         "2014",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-642-54242-8_3",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Aug 21 08:39:11 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_3/",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-642-54242-8",
  book-URL =     "http://www.springerlink.com/content/978-3-642-54242-8",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Garg:2014:TRS,
  author =       "Sanjam Garg and Craig Gentry and Shai Halevi and
                 Mariana Raykova",
  title =        "Two-Round Secure {MPC} from Indistinguishability
                 Obfuscation",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "8349",
  pages =        "74--94",
  year =         "2014",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-642-54242-8_4",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Aug 21 08:39:11 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_4/",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-642-54242-8",
  book-URL =     "http://www.springerlink.com/content/978-3-642-54242-8",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Matsuda:2014:CCS,
  author =       "Takahiro Matsuda and Goichiro Hanaoka",
  title =        "Chosen Ciphertext Security via Point Obfuscation",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "8349",
  pages =        "95--120",
  year =         "2014",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-642-54242-8_5",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Aug 21 08:39:11 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_5/",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-642-54242-8",
  book-URL =     "http://www.springerlink.com/content/978-3-642-54242-8",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Ishai:2014:PCP,
  author =       "Yuval Ishai and Mor Weiss",
  title =        "Probabilistically Checkable Proofs of Proximity with
                 Zero-Knowledge",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "8349",
  pages =        "121--145",
  year =         "2014",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-642-54242-8_6",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Aug 21 08:39:11 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_6/",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-642-54242-8",
  book-URL =     "http://www.springerlink.com/content/978-3-642-54242-8",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Pandey:2014:ACR,
  author =       "Omkant Pandey",
  title =        "Achieving Constant Round Leakage-Resilient
                 Zero-Knowledge",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "8349",
  pages =        "146--166",
  year =         "2014",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-642-54242-8_7",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Aug 21 08:39:11 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_7/",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-642-54242-8",
  book-URL =     "http://www.springerlink.com/content/978-3-642-54242-8",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Orlandi:2014:SCN,
  author =       "Claudio Orlandi and Rafail Ostrovsky and Vanishree Rao
                 and Amit Sahai and Ivan Visconti",
  title =        "Statistical Concurrent Non-malleable Zero Knowledge",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "8349",
  pages =        "167--191",
  year =         "2014",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-642-54242-8_8",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Aug 21 08:39:11 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_8/",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-642-54242-8",
  book-URL =     "http://www.springerlink.com/content/978-3-642-54242-8",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Chung:2014:RRS,
  author =       "Kai-Min Chung and Rafail Ostrovsky and Rafael Pass and
                 Muthuramakrishnan Venkitasubramaniam {\textellipsis}",
  title =        "$4$-Round Resettably-Sound Zero Knowledge",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "8349",
  pages =        "192--216",
  year =         "2014",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-642-54242-8_9",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Aug 21 08:39:11 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_9/",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-642-54242-8",
  book-URL =     "http://www.springerlink.com/content/978-3-642-54242-8",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Dachman-Soled:2014:COF,
  author =       "Dana Dachman-Soled and Mohammad Mahmoody and Tal
                 Malkin",
  title =        "Can Optimally-Fair Coin Tossing Be Based on One-Way
                 Functions?",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "8349",
  pages =        "217--239",
  year =         "2014",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-642-54242-8_10",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Aug 21 08:39:11 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_10/",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-642-54242-8",
  book-URL =     "http://www.springerlink.com/content/978-3-642-54242-8",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Mahmoody:2014:PPK,
  author =       "Mohammad Mahmoody and Hemanta K. Maji and Manoj
                 Prabhakaran",
  title =        "On the Power of Public-Key Encryption in Secure
                 Computation",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "8349",
  pages =        "240--264",
  year =         "2014",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-642-54242-8_11",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Aug 21 08:39:11 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_11/",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-642-54242-8",
  book-URL =     "http://www.springerlink.com/content/978-3-642-54242-8",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Matsuda:2014:IBP,
  author =       "Takahiro Matsuda",
  title =        "On the Impossibility of Basing Public-Coin One-Way
                 Permutations on Trapdoor Permutations",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "8349",
  pages =        "265--290",
  year =         "2014",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-642-54242-8_12",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Aug 21 08:39:11 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_12/",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-642-54242-8",
  book-URL =     "http://www.springerlink.com/content/978-3-642-54242-8",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Asharov:2014:TCC,
  author =       "Gilad Asharov",
  title =        "Towards Characterizing Complete Fairness in Secure
                 Two-Party Computation",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "8349",
  pages =        "291--316",
  year =         "2014",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-642-54242-8_13",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Aug 21 08:39:11 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_13/",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-642-54242-8",
  book-URL =     "http://www.springerlink.com/content/978-3-642-54242-8",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Beimel:2014:CCW,
  author =       "Amos Beimel and Yuval Ishai and Ranjit Kumaresan and
                 Eyal Kushilevitz",
  title =        "On the Cryptographic Complexity of the Worst
                 Functions",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "8349",
  pages =        "317--342",
  year =         "2014",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-642-54242-8_14",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Aug 21 08:39:11 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_14/",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-642-54242-8",
  book-URL =     "http://www.springerlink.com/content/978-3-642-54242-8",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Kiyoshima:2014:CRB,
  author =       "Susumu Kiyoshima and Yoshifumi Manabe and Tatsuaki
                 Okamoto",
  title =        "Constant-Round Black-Box Construction of Composable
                 Multi-Party Computation Protocol",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "8349",
  pages =        "343--367",
  year =         "2014",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-642-54242-8_15",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Aug 21 08:39:11 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_15/",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-642-54242-8",
  book-URL =     "http://www.springerlink.com/content/978-3-642-54242-8",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Hazay:2014:OSA,
  author =       "Carmit Hazay and Arpita Patra",
  title =        "One-Sided Adaptively Secure Two-Party Computation",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "8349",
  pages =        "368--393",
  year =         "2014",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-642-54242-8_16",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Aug 21 08:39:11 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_16/",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-642-54242-8",
  book-URL =     "http://www.springerlink.com/content/978-3-642-54242-8",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Beimel:2014:MLS,
  author =       "Amos Beimel and Aner Ben-Efraim and Carles Padr{\'o}
                 and Ilya Tyomkin",
  title =        "Multi-linear Secret-Sharing Schemes",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "8349",
  pages =        "394--418",
  year =         "2014",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-642-54242-8_17",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Aug 21 08:39:11 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_17/",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-642-54242-8",
  book-URL =     "http://www.springerlink.com/content/978-3-642-54242-8",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Hirt:2014:BA,
  author =       "Martin Hirt and Ueli Maurer and Pavel Raykov",
  title =        "Broadcast Amplification",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "8349",
  pages =        "419--439",
  year =         "2014",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-642-54242-8_18",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Aug 21 08:39:11 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_18/",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-642-54242-8",
  book-URL =     "http://www.springerlink.com/content/978-3-642-54242-8",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Cheraghchi:2014:NMC,
  author =       "Mahdi Cheraghchi and Venkatesan Guruswami",
  title =        "Non-malleable Coding against Bit-Wise and Split-State
                 Tampering",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "8349",
  pages =        "440--464",
  year =         "2014",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-642-54242-8_19",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Aug 21 08:39:11 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_19/",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-642-54242-8",
  book-URL =     "http://www.springerlink.com/content/978-3-642-54242-8",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Faust:2014:CNM,
  author =       "Sebastian Faust and Pratyay Mukherjee and Jesper Buus
                 Nielsen and Daniele Venturi",
  title =        "Continuous Non-malleable Codes",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "8349",
  pages =        "465--488",
  year =         "2014",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-642-54242-8_20",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Thu Aug 21 08:39:11 MDT 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
  URL =          "http://link.springer.com/chapter/10.1007/978-3-642-54242-8_20/",
  acknowledgement = ack-nhfb,
  book-DOI =     "http://dx.doi.org/10.1007/978-3-642-54242-8",
  book-URL =     "http://www.springerlink.com/content/978-3-642-54242-8",
  fjournal =     "Lecture Notes in Computer Science",
}

@Article{Albertini:2014:MHE,
  author =       "Ange Albertini and Jean-Philippe Aumasson and Maria
                 Eichlseder and Florian Mendel and Martin
                 Schl{\"a}ffer",
  title =        "Malicious Hashing: {Eve}'s Variant of {SHA-1}",
  journal =      j-LECT-NOTES-COMP-SCI,
  volume =       "8781",
  pages =        "1--19",
  day =          "29",
  month =        nov,
  year =         "2014",
  CODEN =        "LNCSD9",
  DOI =          "http://dx.doi.org/10.1007/978-3-319-13051-4_1",
  ISSN =         "0302-9743 (print), 1611-3349 (electronic)",
  ISSN-L =       "0302-9743",
  bibdate =      "Mon Mar 09 11:15:46 2015",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
                 http://www.math.utah.edu/pub/tex/bib/hash.bib;
                 http://www.math.utah.edu/pub/tex/bib/lncs2014a.bib",
  series =       ser-LNCS,
  URL =          "http://eprint.iacr.org/2014/694;
                 http://link.springer.com/chapter/10.1007%2F978-3-319-13051-4_1;
                 https://malicioussha1.github.io/",
  abstract =     "We present collisions for a version of SHA-1 with
                 modified constants, where the colliding payloads are
                 valid binary files. Examples are given of colliding
                 executables, archives, and images. Our malicious SHA-1
                 instances have round constants that differ from the
                 original ones in only 40 bits (on average). Modified
                 versions of cryptographic standards are typically used
                 on closed systems (e.g., in pay-TV, media and gaming
                 platforms) and aim to differentiate cryptographic
                 components across customers or services. Our
                 proof-of-concept thus demonstrates the exploitability
                 of custom SHA-1 versions for malicious purposes, such
                 as the injection of user surveillance features. To
                 encourage further research on such malicious hash
                 functions, we propose definitions of malicious hash
                 functions and of associated security notions.",
  acknowledgement = ack-nhfb,
  book-URL =     "http://link.springer.com/chapter/10.1007%2F978-3-319-13051-4",
  fjournal =     "Lecture Notes in Computer Science",
  journal-URL =  "http://link.springer.com/bookseries/558",
  keywords =     "cryptanalysis; hash functions; malicious cryptography,
                 backdoors; secret-key cryptography; SHA-1",
  remark =       "Cite in \cite[reference 2]{Schneier:2015:SWC}.",
}