Sciweavers

5484 search results - page 216 / 1097
» Almost-Everywhere Secure Computation
Sort
View
ASIACRYPT
2003
Springer
15 years 8 months ago
An Efficient Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack
We propose a new public key trace and revoke scheme secure against adaptive chosen ciphertext attack. Our scheme is more efficient than the DF scheme suggested by Y. Dodis and N. F...
Chong Hee Kim, Yong Ho Hwang, Pil Joong Lee
EUROCRYPT
2000
Springer
15 years 8 months ago
Minimal-Latency Secure Function Evaluation
Sander, Young and Yung recently exhibited a protocol for computing on encrypted inputs, for functions computable in NC1 . In their variant of secure function evaluation, Bob (the &...
Donald Beaver
ICDCS
2006
IEEE
15 years 10 months ago
Fast data access over asymmetric channels using fair and secure bandwidth sharing
We propose a peer-to-peer architecture designed to overcome asymmetries in upload/download speeds that are typical in end-user dialup, broadband and cellular wireless Internet con...
Sachin Agarwal, Moshe Laifenfeld, Ari Trachtenberg...
EUC
2006
Springer
15 years 8 months ago
Security in P2P Networks: Survey and Research Directions
A fundamental feature of Peer-to-Peer (P2P) networks is the honest collaboration among an heterogeneous community of participants. After Napster success
Esther Palomar, Juan M. Estévez-Tapiador, J...
ASIAN
2003
Springer
126views Algorithms» more  ASIAN 2003»
15 years 8 months ago
Information Flow Security for XML Transformations
Abstract. We provide a formal definition of information flows in XML transformations and, more generally, in the presence of type driven computations and describe a sound technique...
Véronique Benzaken, Marwan Burelle, Giusepp...