Sciweavers

CRYPTO
2006
Springer
232views Cryptology» more  CRYPTO 2006»
15 years 20 days ago
Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
Abstract. We introduce algebraic geometric techniques in secret sharing and in secure multi-party computation (MPC) in particular. The main result is a linear secret sharing scheme...
Hao Chen, Ronald Cramer
CRYPTO
2006
Springer
224views Cryptology» more  CRYPTO 2006»
15 years 21 days ago
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the...
Xavier Boyen, Brent Waters
CRYPTO
2006
Springer
159views Cryptology» more  CRYPTO 2006»
15 years 21 days ago
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
Saurabh Agarwal, Ronald Cramer, Robbert de Haan
CRYPTO
2006
Springer
155views Cryptology» more  CRYPTO 2006»
15 years 21 days ago
A Method for Making Password-Based Key Exchange Resilient to Server Compromise
This paper considers the problem of password-authenticated key exchange (PAKE) in a client-server setting, where the server authenticates using a stored password file, and it is de...
Craig Gentry, Philip D. MacKenzie, Zulfikar Ramzan
CRYPTO
2006
Springer
149views Cryptology» more  CRYPTO 2006»
15 years 20 days ago
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
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...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...
Cryptology
Top of PageReset Settings