Sciweavers

20 search results - page 3 / 4
» ctrsa 2005
Sort
View
CTRSA
2009
Springer
106views Cryptology» more  CTRSA 2009»
13 years 10 months ago
Communication-Efficient Private Protocols for Longest Common Subsequence
We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to p...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
CTRSA
2005
Springer
221views Cryptology» more  CTRSA 2005»
13 years 11 months ago
Accumulators from Bilinear Pairings and Applications
We propose a dynamic accumulator scheme from bilinear pairings, whose security is based on the Strong Diffie-Hellman assumption. We show applications of this accumulator in constru...
Lan Nguyen
CTRSA
2005
Springer
88views Cryptology» more  CTRSA 2005»
13 years 11 months ago
Sub-linear Queries Statistical Databases: Privacy with Power
Abstract. We consider a statistical database in which a trusted administrator introduces noise to the query responses with the goal of maintaining privacy of individual database en...
Cynthia Dwork
CTRSA
2005
Springer
72views Cryptology» more  CTRSA 2005»
13 years 11 months ago
Proofs for Two-Server Password Authentication
Traditional password-based authentication and key-exchange protocols suffer from the simple fact that a single server stores the sensitive user password. In practice, when such a ...
Michael Szydlo, Burton S. Kaliski Jr.
CTRSA
2005
Springer
154views Cryptology» more  CTRSA 2005»
13 years 11 months ago
Fast and Proven Secure Blind Identity-Based Signcryption from Pairings
We present the first blind identity-based signcryption (BIBSC). We formulate its security model and define the security notions of blindness and parallel one-more unforgeability ...
Tsz Hon Yuen, Victor K. Wei