524 search results - page 83 / 105 » On the Security of the DeKaRT Primitive |
182
click to vote
PKC
2011
Springer
14 years 4 months ago
2011
Springer
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
122
click to vote
TCC
2004
Springer
15 years 7 months ago
2004
Springer
Quantum 2-party cryptography differs from its classical counterpart in at least one important way: Given blak-box access to a perfect commitment scheme there exists a secure 1−2...
104
Voted
KDD
2004
ACM
16 years 2 months ago
2004
ACM
Secure multiparty computation allows parties to jointly compute a function of their private inputs without revealing anything but the output. Theoretical results [2] provide a gen...
120
click to vote
EUROCRYPT
2007
Springer
15 years 8 months ago
2007
Springer
We study an adaptive variant of oblivious transfer in which a sender has N messages, of which a receiver can adaptively choose to receive k one-after-the-other, in such a way that ...
ACNS
2005
Springer
15 years 7 months ago
2005
Springer
Strong security notions often introduce strong constraints on the construction of cryptographic schemes: semantic security implies probabilistic encryption, while the resistance to...