Sciweavers

113 search results - page 17 / 23
» Threshold Fully Homomorphic Encryption and Secure Computatio...
Sort
View
ESOP
2005
Springer
14 years 2 months ago
Computationally Sound, Automated Proofs for Security Protocols
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
Véronique Cortier, Bogdan Warinschi
ISI
2005
Springer
14 years 1 months ago
Private Mining of Association Rules
This paper introduces a new approach to a problem of data sharing among multiple parties, without disclosing the data between the parties. Our focus is data sharing among two parti...
Justin Z. Zhan, Stan Matwin, LiWu Chang
EUROCRYPT
2001
Springer
14 years 28 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
IVC
2008
93views more  IVC 2008»
13 years 8 months ago
A blind source separation-based method for multiple images encryption
Blind source separation (BSS) has been successfully applied to many fields such as communications and biomedical engineering. Its application for image encryption, however, remain...
Qiu-Hua Lin, Fuliang Yin, Tiemin Mei, Hualou Liang
EUROCRYPT
1999
Springer
14 years 21 days ago
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
Pascal Paillier