Programming object interactions is at the heart of object-oriented programming. To improve reusability of the interactions, it is important to program object interactions generica...
Neeraj Sangal, Edward Farrell, Karl J. Lieberherr,...
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...
- Modern tools have simplified the development of the enterprise applications by bridging gaps across various technologies like file systems, relational databases, messaging, and w...
Recent results in interactive proof systems [?][?] [?] seem to indicate that it is easier for a prover in a single prover interactive proof system to cheat the verifier than it i...
This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other...