Sciweavers

252 search results - page 28 / 51
» How Secure is Deterministic Encryption
Sort
View
ICCSA
2005
Springer
14 years 1 months ago
A Formal Analysis of Fairness and Non-repudiation in the RSA-CEGD Protocol
Recently, Nenadi´c et al. (2004) proposed the RSA-CEGD protocol for certified delivery of e-goods. This is a relatively complex scheme based on verifiable and recoverable encryp...
Almudena Alcaide, Juan M. Estévez-Tapiador,...
WSC
2007
13 years 10 months ago
An elliptical cryptographic algorithm for RF wireless devices
In this paper, we propose a new asymmetric cryptographic algorithm (HOOD CRYPT) based on the Elliptical Curve Cryptographic approach. The algorithm describes how an orthogonal fre...
Robert Steven Owor, Khalil Dajani, Zephyrinus Okon...
IFIP
2010
Springer
13 years 2 months ago
Cryptographic Enforcement of Role-Based Access Control
Many cryptographic schemes have been designed to enforce information flow policies. However, enterprise security requirements are often better encoded, or can only be encoded, usin...
Jason Crampton
IFIP
2009
Springer
14 years 7 days ago
Secure Information Flow for Distributed Systems
We present an abstract language for distributed systems of processes with local memory and private communication channels. Communication between processes is done via messaging. Th...
Rafael Alpízar, Geoffrey Smith
DIM
2005
ACM
13 years 9 months ago
Pseudonym management using mediated identity-based cryptography
Mobile Location-Based Services (LBS) have raised privacy concerns amongst mobile phone users who may need to supply their identity and location information to untrustworthy third ...
Thibault Candebat, Cameron Ross Dunne, David T. Gr...