Sciweavers

1769 search results - page 97 / 354
» Cryptography
Sort
View
IPL
2006
118views more  IPL 2006»
15 years 3 months ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune
ENTCS
2007
96views more  ENTCS 2007»
15 years 3 months ago
Cryptographic Pattern Matching
We construct a language extension for process calculi for modelling the exchange of cryptographically composed data. More specifically, we devise a succinct syntax for terms and ...
Christoffer Rosenkilde Nielsen, Flemming Nielson, ...
ENTCS
2000
81views more  ENTCS 2000»
15 years 3 months ago
Secrecy, Group Creation
We lift Cardelli, Ghelli and Gordon's secrecy group creation operator [1] to a relative of the spicalculus that supports symmetric key cryptography, and show a natural extens...
Luca Cardelli, Andy Gordon, Giorgio Ghelli
TCS
2002
15 years 2 months ago
A comparison of two approaches to pseudorandomness
The concept of pseudorandomness plays an important role in cryptography. In this note, we contrast the notions of complexity-theoretic pseudorandom strings (from algorithmic infor...
Yongge Wang
ACSAC
2000
IEEE
15 years 7 months ago
Introducing Decryption Authority into PKI
It is well-known that CA plays the central role in PKI. In this paper we introduce a new component into PKI, DA (decryption authority), which decrypts important and sensitive mess...
Feng Bao