Sciweavers

234 search results - page 3 / 47
» Text Search Protocols with Simulation Based Security
Sort
View
PKC
2010
Springer
119views Cryptology» more  PKC 2010»
14 years 11 months ago
Efficient Set Operations in the Presence of Malicious Adversaries
We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main...
Carmit Hazay, Kobbi Nissim
CSFW
2006
IEEE
15 years 3 months ago
Simulation-Based Security with Inexhaustible Interactive Turing Machines
Recently, there has been much interest in extending models for simulation-based security in such a way that the runtime of protocols may depend on the length of their input. Findi...
Ralf Küsters
ISW
2007
Springer
15 years 3 months ago
Strongly-Secure Identity-Based Key Agreement and Anonymous Extension
Abstract. We study the provable security of identity-based (ID-based) key agreement protocols. Although several published protocols have been proven secure in the random oracle mod...
Sherman S. M. Chow, Kim-Kwang Raymond Choo
ICDCS
2008
IEEE
15 years 4 months ago
Analysis of Maximum Executable Length for Detecting Text-Based Malware
The possibility of using purely text stream (keyboardenterable) as carrier of malware is under-researched and often underestimated. A text attack can happen at multiple levels, fr...
P. Kumar Manna, Sanjay Ranka, Shigang Chen
77
Voted
SIGCOMM
2010
ACM
14 years 9 months ago
How secure are secure interdomain routing protocols
In response to high-profile Internet outages, BGP security variants have been proposed to prevent the propagation of bogus routing information. To inform discussions of which vari...
Sharon Goldberg, Michael Schapira, Peter Hummon, J...