2967 search results - page 191 / 594 » Cryptology |
189
click to vote
CTRSA
2007
Springer
15 years 11 months ago
2007
Springer
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...
177
click to vote
CRYPTO
2009
Springer
15 years 11 months ago
2009
Springer
The round complexity of interactive protocols is one of their most important complexity measures. In this work we prove that existing lower bounds for the round complexity of VSS c...
196
click to vote
FC
2010
Springer
15 years 11 months ago
2010
Springer
We present the first sound program source transformation approach for automatically transforming the code of a legacy web application to employ PREPARE statements in place of unsa...
227
click to vote
PQCRYPTO
2010
15 years 11 months ago
2010
Abstract. Multivariate public key cryptography is one of the main approaches to guarantee the security of communication in a post-quantum world. One of the most promising candidate...
204
click to vote
EUROCRYPT
2007
Springer
15 years 11 months ago
2007
Springer
In a recent paper Mohassel and Franklin study the efficiency of secure two-party computation in the presence of malicious behavior. Their aim is to make classical solutions to this...