1562 search results - page 125 / 313 » Mathematics, Cryptology, Security |
PKC
2010
Springer
14 years 6 days ago
2010
Springer
Liskov proposed several weakened versions of the random oracle model, called weakened random oracle models (WROMs), to capture the vulnerability of ideal compression functions, wh...
FSE
2004
Springer
14 years 9 hour ago
2004
Springer
ded abstract of this paper appears in Fast Software Encryption, FSE 2004, Lecture Notes in Computer Science, W. Meier and B. Roy editors, Springer-Verlag, 2004. This is the full ve...
CRYPTO
2006
Springer
13 years 12 months ago
2006
Springer
In the setting of multiparty computation, a set of parties wish to jointly compute a function of their inputs, while preserving security in the case that some subset of them are co...
ASIACRYPT
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. In secure computation among a set P of players one considers an adversary who can corrupt certain players. The three usually considered types of corruption are active, pa...
EUROCRYPT
2008
Springer
13 years 10 months ago
2008
Springer
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...