169 search results - page 18 / 34 » Which Languages Have 4-Round Zero-Knowledge Proofs |
IEICET
2006
13 years 7 months ago
2006
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
FSTTCS
1994
Springer
13 years 11 months ago
1994
Springer
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
MayBMS is a state-of-the-art probabilistic database management system which leverages the strengths of previous database research for achieving scalability. As a proof of concept ...
TLDI
2009
ACM
14 years 4 months ago
2009
ACM
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...