Sciweavers

326 search results - page 23 / 66
» Digital Signature Scheme Based on a New Hard Problem
Sort
View
EUROCRYPT
2001
Springer
14 years 3 days ago
The Bit Security of Paillier's Encryption Scheme and Its Applications
At EuroCrypt’99, Paillier proposed a new encryption scheme based on higher residuosity classes. The new scheme was proven to be one-way under the assumption that computing N-resi...
Dario Catalano, Rosario Gennaro, Nick Howgrave-Gra...
ENTCS
2006
124views more  ENTCS 2006»
13 years 7 months ago
A New Rabin-type Trapdoor Permutation Equivalent to Factoring
Public key cryptography has been invented to overcome some key management problems in open networks. Although nearly all aspects of public key cryptography rely on the existence of...
Katja Schmidt-Samoa
MOBISYS
2008
ACM
14 years 7 months ago
Detecting energy-greedy anomalies and mobile malware variants
Mobile users of computation and communication services have been rapidly adopting battery-powered mobile handhelds, such as PocketPCs and SmartPhones, for their work. However, the...
Hahnsang Kim, Joshua Smith, Kang G. Shin
DAC
2001
ACM
14 years 8 months ago
Publicly Detectable Techniques for the Protection of Virtual Components
Highlighted with the newly released intellectual property (IP) protection white paper by VSI Alliance, the protection of virtual components (VCs) has received a large amount of at...
Gang Qu
EUROCRYPT
2001
Springer
14 years 3 days ago
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
Abstract. We show that finding an efficiently computable injective homomorphism from the XTR subgroup into the group of points over GF(p2 ) of a particular type of supersingular e...
Eric R. Verheul