515 search results - page 9 / 103 » Secure Parameters for SWIFFT |
115
click to vote
ICDM
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--This paper presents a framework for privacypreserving Gaussian Mixture Model computations. Specifically, we consider a scenario where a central service wants to learn the...
122
click to vote
PET
2012
Springer
13 years 2 months ago
2012
Springer
It is widely accepted that Disclosure Attacks are effective against high-latency anonymous communication systems. A number of Disclosure Attack variants can be found in the litera...
CHI
2010
ACM
15 years 6 months ago
2010
ACM
Click-based graphical passwords have attractive usability properties, such as cueing and good memorability. However, image size and number of click-points in each password signifi...
104
click to vote
SCN
2008
Springer
14 years 11 months ago
2008
Springer
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...
IACR
2011
13 years 11 months ago
2011
Barreto-Lynn-Scott (BLS) curves are a stand-out candidate for implementing high-security pairings. This paper shows that particular choices of the pairing-friendly search parameter...