This paper initiates a study of Fine Grained Secure Computation: ie the construction of secure computation primitives against “moderately complex” adversaries. We present …
We investigate proof systems where security holds against rational parties instead of malicious ones. Our starting point is the notion of rational arguments, a variant of rational …
We consider a setting where a verifier with limited computation power delegates a resource intensive computation task—which requires a T * S computation tableau—to two provers …
D Musatov, G Potapov - Conference on Computability in Europe, 2023 - Springer
Abstract In 2012 PD Azar and S. Micali introduced a new model of interactive proofs, called “Rational Interactive Proofs”. In this model the prover is neither honest nor malicious, but …
M Fujita, T Koshiba, K Yasunaga - IEEE Journal on Selected …, 2022 - ieeexplore.ieee.org
Secure Message Transmission (SMT) is a two-party cryptographic protocol by which the sender can securely and reliably transmit messages to the receiver using multiple channels …
The term “game” has substantially different meanings within the security area, depending on whether we speak about cryptographic security in particular, or system security in a more …
Interactive-proof games model the scenario where an honest party interacts with powerful but strategic provers, to elicit from them the correct answer to a computational question …
M Fujita, K Yasunaga, T Koshiba - Decision and Game Theory for Security …, 2018 - Springer
Abstract Secure Message Transmission (SMT) is a two-party cryptographic protocol by which the sender can securely and reliably transmit messages to the receiver using multiple …
The term “game” has substantially different meanings within the security area, depending on whether we speak about cryptographic security in particular, or system security in a more …