1411 search results - page 77 / 283 » Interactive Coding for Interactive Proofs |
96
Voted
IPPS
2009
IEEE
15 years 7 months ago
2009
IEEE
Parallel applications typically run in batch mode, sometimes after long waits in a scheduler queue. In some situations, it would be desirable to interactively add new functionalit...
214
click to vote
ECOOP
2009
Springer
16 years 1 months ago
2009
Springer
The primary goal of exception mechanisms is to help ensure that when an operation fails, code that depends on the operation's successful completion is not executed (a property...
118
click to vote
TARK
2009
Springer
15 years 7 months ago
2009
Springer
Halpern, Moses and Tuttle presented a definition of interactive proofs using a notion they called practical knowledge, but left open the question of finding an epistemic formula...
100
click to vote
APLAS
2009
ACM
15 years 7 months ago
2009
ACM
We define a higher-order process calculus with algebraic operations such as encryption and decryption, and develop a bisimulation proof method for behavioral equivalence in this c...
119
click to vote
CRYPTO
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...