Sciweavers

239 search results - page 29 / 48
» Proof Techniques for Cryptographic Processes
Sort
View
PET
2010
Springer
14 years 17 days ago
Making a Nymbler Nymble Using VERBS
In this work, we propose a new platform to enable service providers, such as web site operators, on the Internet to block past abusive users of anonymizing networks (for example, T...
Ryan Henry, Kevin Henry, Ian Goldberg
CRYPTO
2010
Springer
171views Cryptology» more  CRYPTO 2010»
13 years 9 months ago
Credential Authenticated Identification and Key Exchange
Secure two-party authentication and key exchange are fundamental problems. Traditionally, the parties authenticate each other by means of their identities, using a public-key infr...
Jan Camenisch, Nathalie Casati, Thomas Groß,...
TCC
2012
Springer
226views Cryptology» more  TCC 2012»
12 years 4 months ago
On the Instantiability of Hash-and-Sign RSA Signatures
The hash-and-sign RSA signature is one of the most elegant and well known signatures schemes, extensively used in a wide variety of cryptographic applications. Unfortunately, the o...
Yevgeniy Dodis, Iftach Haitner, Aris Tentes
IFIP
2004
Springer
14 years 2 months ago
Ensuring Termination by Typability
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
Yuxin Deng, Davide Sangiorgi
GCA
2007
13 years 10 months ago
Transparent File Protection in On-Demand Computing
On-Demand Computing fulfills the need of computing availability at limited hardware and software costs. Distributed systems of this kind typically store user files in a shared ...
Fabio Dellutri, Salvatore Di Blasi, Giuseppe F. It...