Sciweavers

1562 search results - page 41 / 313
» Mathematics, Cryptology, Security
Sort
View
AFRICACRYPT
2008
Springer
14 years 2 months ago
A Brief History of Provably-Secure Public-Key Encryption
Public-key encryption schemes are a useful and interesting field of cryptographic study. The ultimate goal for the cryptographer in the field of public-key encryption would be th...
Alexander W. Dent
PKC
2001
Springer
95views Cryptology» more  PKC 2001»
14 years 14 days ago
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
This paper introduces a novel class of computational problems, the gap problems, which can be considered as a dual to the class of the decision problems. We show the relationship a...
Tatsuaki Okamoto, David Pointcheval
FSE
1998
Springer
79views Cryptology» more  FSE 1998»
14 years 8 days ago
On the Design and Security of RC2
The block cipher RC2 was designed in 1989 by Ron Rivest for RSA Data Security Inc. In this paper we describe both the cipher and preliminary attempts to use both differential and l...
Lars R. Knudsen, Vincent Rijmen, Ronald L. Rivest,...
CRYPTO
2007
Springer
93views Cryptology» more  CRYPTO 2007»
13 years 12 months ago
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
Oblivious transfer (OT) is an essential building block for secure multiparty computation when there is no honest majority. In this setting, current protocols for n 3 parties requ...
Danny Harnik, Yuval Ishai, Eyal Kushilevitz
ASIACRYPT
2008
Springer
13 years 10 months ago
Graph Design for Secure Multiparty Computation over Non-Abelian Groups
Recently, Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. They considered the passive adversary model and they assumed that the...
Xiaoming Sun, Andrew Chi-Chih Yao, Christophe Tart...