Sciweavers

436 search results - page 70 / 88
» Using trust assumptions with security requirements
Sort
View
ASIACRYPT
2003
Springer
15 years 5 months ago
Generalized Powering Functions and Their Application to Digital Signatures
This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayn...
Hisayoshi Sato, Tsuyoshi Takagi, Satoru Tezuka, Ka...
SAC
2010
ACM
15 years 6 months ago
Content cloaking: preserving privacy with Google Docs and other web applications
Web office suites such as Google Docs offer unparalleled collaboration experiences in terms of low software requirements, ease of use, data ubiquity, and availability. When the d...
Gabriele D'Angelo, Fabio Vitali, Stefano Zacchirol...
NDSS
2003
IEEE
15 years 5 months ago
Fighting Spam by Encapsulating Policy in Email Addresses
Everyday network interactions require users to give out their email address, yet no guarantees can be made about how this address will be used. Sometimes the address is given to a...
John Ioannidis
ICETE
2004
253views Business» more  ICETE 2004»
15 years 1 months ago
BLAZE: A Mobile Agent Paradigm for VoIP Intrusion Detection Systems
ser provides abstraction for supporting flexible security policies that can be developed using the low-level primitives of the browser. We believe our browser architecture will be ...
Kapil Singh, Son T. Vuong
CCS
2008
ACM
15 years 1 months ago
Multi-use unidirectional proxy re-signatures
In 1998, Blaze, Bleumer, and Strauss suggested a cryptographic primitive termed proxy re-signature in which a proxy transforms a signature computed under Alice's secret key in...
Benoît Libert, Damien Vergnaud