Sciweavers

22 search results - page 1 / 5
» ctrsa 2006
Sort
View
CTRSA
2006
Springer
88views Cryptology» more  CTRSA 2006»
13 years 8 months ago
On the (Im)possibility of Blind Message Authentication Codes
Michel Abdalla, Chanathip Namprempre, Gregory Neve...
CTRSA
2006
Springer
107views Cryptology» more  CTRSA 2006»
13 years 8 months ago
A Round and Communication Efficient Secure Ranking Protocol
In this work, we initiate the study of realizing a ranking functionality (m1,
Shaoquan Jiang, Guang Gong
CTRSA
2006
Springer
176views Cryptology» more  CTRSA 2006»
13 years 8 months ago
Chosen Ciphertext Secure Public Key Threshold Encryption Without Random Oracles
Abstract. We present a non-interactive chosen ciphertext secure threshold encryption system. The proof of security is set in the standard model and does not use random oracles. Our...
Dan Boneh, Xavier Boyen, Shai Halevi
CTRSA
2006
Springer
90views Cryptology» more  CTRSA 2006»
13 years 8 months ago
Fair Identification
This paper studies a new problem called fair identification: given two parties, how should they identify each other in a fair manner. More precisely, if both parties are honest the...
Omkant Pandey, Julien Cathalo, Jean-Jacques Quisqu...
CTRSA
2007
Springer
102views Cryptology» more  CTRSA 2007»
13 years 8 months ago
Improved Efficiency for Private Stable Matching
At Financial Crypto 2006, Golle presented a novel framework for the privacy preserving computation of a stable matching (stable marriage). We show that the communication complexity...
Matthew K. Franklin, Mark Gondree, Payman Mohassel