46 search results - page 9 / 10 » crypto 2005 |
PAIRING
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
ACNS
2005
Springer
14 years 1 months ago
2005
Springer
Typical protocols for password-based authentication assume a single server which stores all the information (e.g., the password) necessary to authenticate a user. Unfortunately, a...
FSE
2006
Springer
13 years 11 months ago
2006
Springer
The security of hash functions has recently become one of the hottest topics in the design and analysis of cryptographic primitives. Since almost all the hash functions used today ...
ASIACRYPT
2005
Springer
14 years 1 months ago
2005
Springer
Cryptosystems based on the knapsack problem were among the first public-key systems to be invented. Their high encryption/decryption rate attracted considerable interest until it ...
DC
2007
13 years 7 months ago
2007
Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...