195 search results - page 26 / 39 » Security and Privacy Using One-Round Zero-Knowledge Proofs |
ACISP
2007
Springer
15 years 6 months ago
2007
Springer
We propose the first single sign-on system in which a user can access services using unlinkable digital pseudonyms that can all be revoked in case she abuses any one service. Our ...
118
click to vote
CSFW
2005
IEEE
15 years 5 months ago
2005
IEEE
A number of key establishment protocols claim the property of forward secrecy, where the compromise of a longterm key does not result in the compromise of previously computed sess...
104
click to vote
CSFW
1997
IEEE
15 years 4 months ago
1997
IEEE
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
CSFW
1996
IEEE
15 years 3 months ago
1996
IEEE
: This paper examines some of the theoretical foundations of the distributable change detection method introduced by Forrest et al. in [10], including fundamental bounds on some of...
CSFW
1998
IEEE
15 years 3 months ago
1998
IEEE
In previous work [16], we give a type system that guarantees that well-typed multithreaded programs are possibilistically noninterfering. If thread scheduling is probabilistic, ho...