169 search results - page 22 / 34 » Which Languages Have 4-Round Zero-Knowledge Proofs |
SAS
1999
Springer
13 years 11 months ago
1999
Springer
ing Cryptographic Protocols with Tree Automata David Monniaux http://www.di.ens.fr/%7Fmonniaux, Laboratoire d’Informatique, ´Ecole Normale Sup´erieure, 45 rue d’Ulm , 75230 P...
JSW
2008
13 years 7 months ago
2008
Automated negotiation is an important applying field of agent theory and technology. For the current agent theoretical models have some troubles in explaining the agent's nego...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
Traditionally, the full verification of a program's functional correctness has been obtained with pen and paper or with interactive proof assistants, whereas only reduced ver...
PLILP
1992
Springer
13 years 11 months ago
1992
Springer
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...
LPAR
2012
Springer
12 years 3 months ago
2012
Springer
Abstract. The TPTP World is a well established infrastructure supporting research, development, and deployment of Automated Theorem Proving systems. Recently, the TPTP World has be...