8 Result(s)
-
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 ...
-
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
-
Chapter and Conference Paper
Online-Untransferable Signatures
Non-transferability of digital signatures is an important security concern, traditionally achieved via interactive verification protocols. Such protocols, however, are vulnerable to “online transfer attacks” —...
-
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...
-
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...
-
Chapter and Conference Paper
Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering
Traditionally, secure cryptographic algorithms provide security against an adversary who has only black-box access to the secret information of honest parties. However, such models are not always adequate. In par...
-
Chapter and Conference Paper
Physically Observable Cryptography
Complexity-theoretic cryptography considers only abstract notions of computation, and hence cannot protect against attacks that exploit the information leakage (via electromagnetic fields, power consumption, e...
-
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...
