Sciweavers

39 search results - page 3 / 8
» Improved Non-committing Encryption with Applications to Adap...
Sort
View
ACNS
2003
Springer
193views Cryptology» more  ACNS 2003»
15 years 2 months ago
Round Optimal Distributed Key Generation of Threshold Cryptosystem Based on Discrete Logarithm Problem
Distributed key generation is one of the most challenging tasks for threshold cryptosystems. Designing such a protocol and proving its security against a malicious, adaptive adver...
Rui Zhang 0002, Hideki Imai
STORAGESS
2005
ACM
15 years 3 months ago
Security of erasable memories against adaptive adversaries
We study cryptographic modeling and encryption-based design techniques for guaranteeing privacy of data that is first stored in some type of computer memory and then deleted. We ...
Giovanni Di Crescenzo
CCS
2001
ACM
15 years 2 months ago
The performance of public key-enabled kerberos authentication in mobile computing applications
Authenticating mobile computing users can require a significant amount of processing and communications resources— particularly when protocols based on public key encryption are...
Alan Harbitter, Daniel A. Menascé
CCS
1999
ACM
15 years 1 months ago
Password Hardening Based on Keystroke Dynamics
We present a novel approach to improving the security of passwords. In our approach, the legitimate user’s typing patterns (e.g., durations of keystrokes and latencies between ke...
Fabian Monrose, Michael K. Reiter, Susanne Wetzel
ASIACRYPT
2009
Springer
15 years 4 months ago
Secure Two-Party Computation Is Practical
Abstract. Secure multi-party computation has been considered by the cryptographic community for a number of years. Until recently it has been a purely theoretical area, with few im...
Benny Pinkas, Thomas Schneider, Nigel P. Smart, St...