Last update: Wed Nov 7 02:05:14 MST 2018
@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 = "https://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 = "https://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", }