12774 search results - page 127 / 2555 » A Framework for Proof Systems |
185
click to vote
ASIAN
2009
Springer
15 years 5 months ago
2009
Springer
In cryptographic protocols, zero knowledge proofs are employed for a principal A to communicate some non-trivial information t to B while at the same time ensuring that B cannot de...
147
click to vote
JAR
2006
15 years 4 months ago
2006
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
151
click to vote
PPDP
2007
Springer
15 years 10 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
143
click to vote
DIM
2005
ACM
15 years 6 months ago
2005
ACM
We develop solutions for the security and privacy of user identity information in a federation. By federation we mean a group of organizations or service providers which have buil...
150
click to vote
GLOBECOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Proof of a user's identity is not always a sufficient means for making an authorization decision. In an increasing set of circumstances, knowledge of physical location provide...