15 search results - page 2 / 3 » On the Round Security of Symmetric-Key Cryptographic Primiti... |
131
click to vote
COCO
2010
Springer
15 years 2 months ago
2010
Springer
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
131
click to vote
CRYPTO
2005
Springer
15 years 7 months ago
2005
Springer
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
121
click to vote
ASIACRYPT
2010
Springer
14 years 11 months ago
2010
Springer
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
106
click to vote
EUROCRYPT
2007
Springer
15 years 8 months ago
2007
Springer
Feistel Network, consisting of a repeated application of the Feistel Transform, gives a very convenient and popular method for designing “cryptographically strong” permutations...
ACNS
2010
Springer
15 years 2 months ago
2010
Springer
In this work, we design two-party and multiparty protocols for evaluating multivariate polynomials at participants' inputs with security against a malicious adversary who may ...