Sciweavers

213 search results - page 24 / 43
» Can Homomorphic Encryption be Practical
Sort
View
TIT
2008
79views more  TIT 2008»
13 years 7 months ago
Skipping, Cascade, and Combined Chain Schemes for Broadcast Encryption
We develop a couple of new methods to reduce transmission overheads in broadcast encryption. The methods are based on the idea of assigning one key per each partition using one-way...
Jung Hee Cheon, Nam-Su Jho, Myung-Hwan Kim, Eun Su...
ACNS
2004
Springer
131views Cryptology» more  ACNS 2004»
13 years 11 months ago
Evaluating Security of Voting Schemes in the Universal Composability Framework
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...
Jens Groth
FC
2006
Springer
109views Cryptology» more  FC 2006»
13 years 11 months ago
A Private Stable Matching Algorithm
Existing stable matching algorithms reveal the preferences of all participants, as well as the history of matches made and broken in the course of computing a stable match. This in...
Philippe Golle
FSE
1997
Springer
280views Cryptology» more  FSE 1997»
13 years 11 months ago
New Block Encryption Algorithm MISTY
We propose secret-key cryptosystems MISTY1 and MISTY2, which are block ciphers with a 128-bit key, a 64-bit block and a variable number of rounds. MISTY is a generic name for MISTY...
Mitsuru Matsui
ICB
2009
Springer
156views Biometrics» more  ICB 2009»
13 years 5 months ago
Efficient Biometric Verification in Encrypted Domain
Biometric authentication over public networks leads to a variety of privacy issues that needs to be addressed before it can become popular. The primary concerns are that the biomet...
Maneesh Upmanyu, Anoop M. Namboodiri, K. Srinathan...