1562 search results - page 126 / 313 » Mathematics, Cryptology, Security |
166
click to vote
CRYPTO
2011
Springer
14 years 6 months ago
2011
Springer
Secure computation enables mutually suspicious parties to compute a joint function of their private inputs while providing strong security guarantees. Amongst other things, even i...
161
Voted
ASIACRYPT
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. Whereas encryption schemes withstanding passive chosenplaintext attacks (CPA) can be constructed based on a variety of computational assumptions, only a few assumptions a...
175
click to vote
CRYPTO
2001
Springer
15 years 10 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
152
click to vote
ASIACRYPT
2007
Springer
15 years 10 months ago
2007
Springer
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversa...
174
Voted
CRYPTO
2011
Springer
14 years 6 months ago
2011
Springer
Deterministic public-key encryption, introduced by Bellare, Boldyreva, and O’Neill (CRYPTO ’07), provides an alternative to randomized public-key encryption in various scenari...