3228 search results - page 313 / 646 » Computationally Sound Proofs |
114
click to vote
BIRTHDAY
2005
Springer
15 years 10 months ago
2005
Springer
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
136
click to vote
ITRUST
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Question answering systems users may find answers without any supporting information insufficient for determining trust levels. Once those question answering systems beg...
141
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We show how a polynomial-time prover can commit to an arbitrary finite set Ë of strings so that, later on, he can, for any string Ü, reveal with a proof whether Ü ¾ Ë or Ü ...
147
click to vote
JOOP
1998
15 years 4 months ago
1998
A set of rules to ascertain that in calls of the form x.f (...) there will always be an object attached to x. 1 PURPOSE The theory developed in this article investigates void call...
153
click to vote
PODC
2011
ACM
14 years 7 months ago
2011
ACM
We present a cryptographic framework to achieve access control, privacy of social relations, secrecy of resources, and anonymity of users in social networks. The main idea is to u...