Sciweavers

321 search results - page 52 / 65
» Secure Multiparty Computation of Approximations
Sort
View
MEDIAFORENSICS
2010
13 years 9 months ago
Biometric template transformation: a security analysis
One of the critical steps in designing a secure biometric system is protecting the templates of the users that are stored either in a central database or on smart cards. If a biom...
Abhishek Nagar, Karthik Nandakumar, Anil K. Jain
CSFW
2006
IEEE
14 years 4 months ago
Decentralized Robustness
Robustness links confidentiality and integrity properties of a computing system and has been identified as a useful property for characterizing and enforcing security. Previous ...
Stephen Chong, Andrew C. Myers
IACR
2011
212views more  IACR 2011»
12 years 10 months ago
Fully Homomorphic Encryption without Bootstrapping
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual con...
Zvika Brakerski, Craig Gentry, Vinod Vaikuntanatha...
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
13 years 11 months ago
On the low hamming weight discrete logarithm problem for nonadjacent representations
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
James A. Muir, Douglas R. Stinson
AMC
2011
13 years 2 months ago
Ruin theory with excess of loss reinsurance and reinstatements
The present paper studies the probability of ruin of an insurer, if excess of loss reinsurance with reinstatements is applied. In the setting of the classical CramerLundberg risk ...
Hansjörg Albrecher, Sandra Haas