Sciweavers

3504 search results - page 635 / 701
» Secure protocol composition
Sort
View
CANS
2011
Springer
258views Cryptology» more  CANS 2011»
14 years 1 months ago
Fast Computation on Encrypted Polynomials and Applications
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
Payman Mohassel
AVBPA
2005
Springer
395views Biometrics» more  AVBPA 2005»
15 years 3 months ago
A Score-Level Fusion Benchmark Database for Biometric Authentication
Fusing the scores of several biometric systems is a very promising approach to improve the overall system’s accuracy. Despite many works in the literature, it is surprising that ...
Norman Poh, Samy Bengio
TCC
2009
Springer
116views Cryptology» more  TCC 2009»
16 years 1 months ago
Simulation-Based Concurrent Non-malleable Commitments and Decommitments
Abstract. In this paper we consider commitment schemes that are secure against concurrent man-in-the-middle (cMiM) attacks. Under such attacks, two possible notions of security for...
Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti
CCS
2009
ACM
15 years 8 months ago
Scalable onion routing with torsk
We introduce Torsk, a structured peer-to-peer low-latency anonymity protocol. Torsk is designed as an interoperable replacement for the relay selection and directory service of th...
Jon McLachlan, Andrew Tran, Nicholas Hopper, Yongd...
SP
2009
IEEE
106views Security Privacy» more  SP 2009»
15 years 8 months ago
Pretty-Bad-Proxy: An Overlooked Adversary in Browsers' HTTPS Deployments
– HTTPS is designed to provide secure web communications over insecure networks. The protocol itself has been rigorously designed and evaluated by assuming the network as an adve...
Shuo Chen, Ziqing Mao, Yi-Min Wang, Ming Zhang