Sciweavers

CRYPTO
2006
Springer
232views Cryptology» more  CRYPTO 2006»
13 years 8 months 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
101views Cryptology» more  CRYPTO 2006»
13 years 8 months ago
When Random Sampling Preserves Privacy
Kamalika Chaudhuri, Nina Mishra
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
13 years 8 months ago
On Signatures of Knowledge
In a traditional signature scheme, a signature on a message m is issued under a public key PK, and can be interpreted as follows: "The owner of the public key PK and its corr...
Melissa Chase, Anna Lysyanskaya
CRYPTO
2006
Springer
125views Cryptology» more  CRYPTO 2006»
13 years 8 months ago
On the Higher Order Nonlinearities of Algebraic Immune Functions
Abstract. One of the most basic requirements concerning Boolean functions used in cryptosystems is that they must have high algebraic degrees. This simple criterion is not always w...
Claude Carlet
CRYPTO
2006
Springer
124views Cryptology» more  CRYPTO 2006»
13 years 8 months ago
Mitigating Dictionary Attacks on Password-Protected Local Storage
We address the issue of encrypting data in local storage using a key that is derived from the user's password. The typical solution in use today is to derive the key from the...
Ran Canetti, Shai Halevi, Michael Steiner
CRYPTO
2006
Springer
224views Cryptology» more  CRYPTO 2006»
13 years 8 months 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
125views Cryptology» more  CRYPTO 2006»
13 years 8 months ago
Automated Security Proofs with Sequences of Games
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
Bruno Blanchet, David Pointcheval
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
13 years 8 months ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir
CRYPTO
2006
Springer
159views Cryptology» more  CRYPTO 2006»
13 years 8 months 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»
13 years 8 months 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