Sciweavers

3504 search results - page 568 / 701
» Secure protocol composition
Sort
View
EUROCRYPT
2005
Springer
15 years 7 months ago
On Robust Combiners for Oblivious Transfer and Other Primitives
A (1,2)-robust combiner for a cryptographic primitive P is a construction that takes two candidate schemes for P and combines them into one scheme that securely implement P even i...
Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold...
SIGUCCS
2003
ACM
15 years 6 months ago
Regaining single sign-on taming the beast
It has been our effort at Ringling school to provide our campus community with the capability to uniformly access resources across multiple platforms. Empowering the user with a s...
Divyangi Anchan, Mahmoud Pegah
CCS
2003
ACM
15 years 6 months ago
Enhancing byte-level network intrusion detection signatures with context
Many network intrusion detection systems (NIDS) use byte sequences as signatures to detect malicious activity. While being highly efficient, they tend to suffer from a high false...
Robin Sommer, Vern Paxson
CRYPTO
2006
Springer
155views Cryptology» more  CRYPTO 2006»
15 years 5 months ago
A Method for Making Password-Based Key Exchange Resilient to Server Compromise
This paper considers the problem of password-authenticated key exchange (PAKE) in a client-server setting, where the server authenticates using a stored password file, and it is de...
Craig Gentry, Philip D. MacKenzie, Zulfikar Ramzan
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
15 years 5 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...