Skip to main content

and
  1. Chapter and Conference Paper

    Purely Rational Secret Sharing (Extended Abstract)

    Rational secret sharing is a problem at the intersection of cryptography and game theory. In essence, a dealer wishes to engineer a communication game that, when rationally played, guarantees that each of the ...

    Silvio Micali, abhi shelat in Theory of Cryptography (2009)

  2. Chapter and Conference Paper

    Verifiably Secure Devices

    We put forward the notion of a verifiably secure device, in essence a stronger notion of secure computation, and achieve it in the ballot-box model. Verifiably secure devices

    Sergei Izmalkov, Matt Lepinski, Silvio Micali in Theory of Cryptography (2008)

  3. Chapter and Conference Paper

    Fair-Zero Knowledge

    We introduce Fair Zero-Knowledge, a multi-verifier ZK system where every proof is guaranteed to be “zero-knowledge for all verifiers.” That is, if an honest verifier accepts a fair zero-knowledge proof, then he i...

    Matt Lepinski, Silvio Micali, Abhi Shelat in Theory of Cryptography (2005)

  4. Chapter and Conference Paper

    Optimal Error Correction Against Computationally Bounded Noise

    For computationally bounded adversarial models of error, we construct appealingly simple, efficient, cryptographic encoding and unique decoding schemes whose error-correction capability is much greater than cl...

    Silvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson in Theory of Cryptography (2005)

  5. No Access

    Chapter and Conference Paper

    Fractal Merkle Tree Representation and Traversal

    We introduce a technique for traversal of Merkle trees, and propose an efficient algorithm that generates a sequence of leaves along with their associated authentication paths. For one choice of parameters, an...

    Markus Jakobsson, Tom Leighton, Silvio Micali in Topics in Cryptology — CT-RSA 2003 (2003)