Sciweavers

1562 search results - page 179 / 313
» Mathematics, Cryptology, Security
Sort
View
ISCI
2008
160views more  ISCI 2008»
13 years 8 months ago
Certificateless undeniable signature scheme
In this paper, we present the first certificateless undeniable signature scheme. The scheme does not suffer from the key escrow problem, which is inherent in identity based crypto...
Shanshan Duan
CRYPTO
2005
Springer
125views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Secure Computation Without Authentication
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pa...
TCC
2005
Springer
113views Cryptology» more  TCC 2005»
14 years 1 months ago
Entropic Security and the Encryption of High Entropy Messages
Russell and Wang [22] recently introduced an elegant, information-theoretic notion called entropic security of encryption: they required that the cipher text leak no predicate of ...
Yevgeniy Dodis, Adam Smith
SP
1989
IEEE
160views Security Privacy» more  SP 1989»
14 years 10 days ago
The Chinese Wall Security Policy
Everyone who has seen the movie Wall Street will have seen a commercial security policy in action. The recent work of Clark and Wilson and the WIPCIS initiative (the Workshop on I...
D. F. C. Brewer, M. J. Nash
CHES
2000
Springer
114views Cryptology» more  CHES 2000»
13 years 12 months ago
Efficient Generation of Prime Numbers
The generation of prime numbers underlies the use of most public-key schemes, essentially as a major primitive needed for the creation of key pairs or as a computation stage appear...
Marc Joye, Pascal Paillier, Serge Vaudenay