Sciweavers

570 search results - page 70 / 114
» Black-box constructions for secure computation
Sort
View
ASIACRYPT
2003
Springer
14 years 1 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...
ESORICS
2009
Springer
14 years 8 months ago
Formal Indistinguishability Extended to the Random Oracle Model
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
Cristian Ene, Yassine Lakhnech, Van Chan Ngo
MOBISYS
2008
ACM
14 years 7 months ago
Behavioral detection of malware on mobile handsets
A novel behavioral detection framework is proposed to detect mobile worms, viruses and Trojans, instead of the signature-based solutions currently available for use in mobile devi...
Abhijit Bose, Xin Hu, Kang G. Shin, Taejoon Park
ICALP
2005
Springer
14 years 1 months ago
Completely Non-malleable Schemes
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
Marc Fischlin
ACSAC
2004
IEEE
13 years 11 months ago
Correlating Intrusion Events and Building Attack Scenarios Through Attack Graph Distances
We map intrusion events to known exploits in the network attack graph, and correlate the events through the corresponding attack graph distances. From this, we construct attack sc...
Steven Noel, Eric Robertson, Sushil Jajodia