53 search results - page 5 / 11 » The Exact Round Complexity of Secure Computation |
CRYPTO
2000
Springer
13 years 10 months ago
2000
Springer
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
ESORICS
2004
Springer
13 years 11 months ago
2004
Springer
This paper considers iterated ciphers and their resistance against linear and differential cryptanalysis. In the theory of these attacks one assumes independence of the round keys...
SACRYPT
2009
Springer
14 years 9 days ago
2009
Springer
We re-visit the problem of secure multiparty set intersection in information theoretic settings. In [16], Li et.al have proposed a protocol for multiparty set intersection problem...
FOCS
2007
IEEE
14 years 3 days ago
2007
IEEE
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
ASIACRYPT
2009
Springer
14 years 11 days ago
2009
Springer
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...