1562 search results - page 130 / 313 » Mathematics, Cryptology, Security |
CRYPTO
2000
Springer
14 years 19 days ago
2000
Springer
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
EUROCRYPT
1999
Springer
14 years 17 days ago
1999
Springer
We consider the problem of basing Oblivious Transfer (OT) and Bit Commitment (BC), with information theoretic security, on seemingly weaker primitives. We introduce a general model...
CRYPTO
2008
Springer
13 years 10 months ago
2008
Springer
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...
USS
2008
13 years 10 months ago
2008
In this paper we attempt to answer two questions: (1) Why should we be interested in the security of control systems? And (2) What are the new and fundamentally different requirem...
ASIACRYPT
2006
Springer
14 years 1 days ago
2006
Springer
There have been active discussions on how to derive a consistent cryptographic key from noisy data such as biometric templates, with the help of some extra information called a ske...