677 search results - page 126 / 136 » Secure Pseudonymous Channels |
CP
2000
Springer
15 years 1 months ago
2000
Springer
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...
LICS
1999
IEEE
15 years 1 months ago
1999
IEEE
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
107
click to vote
MA
1999
Springer
15 years 1 months ago
1999
Springer
Many real-world tasks can be decomposed into pipelines of sequential operations (where subtasks may themselves be composed of one or more pipelines). JGram is a framework enabling...
ESWS
2004
Springer
15 years 1 months ago
2004
Springer
Gaining access to sensitive resources on the Web usually involves an explicit registration step, where the client has to provide a predetermined set of information to the server. T...
CRYPTO
2006
Springer
15 years 1 months ago
2006
Springer
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first...