Sciweavers

1769 search results - page 210 / 354
» Cryptography
Sort
View
JOC
2002
76views more  JOC 2002»
15 years 3 months ago
A Note on Negligible Functions
In theoretical cryptography, one formalizes the notion of an adversary's success probability being "too small to matter" by asking that it be a negligible function ...
Mihir Bellare
JOC
1998
162views more  JOC 1998»
15 years 3 months ago
A Software-Optimized Encryption Algorithm
We describe a software-e cient encryption algorithm named SEAL 3.0. Computational cost on a modern 32-bit processor is about 4 clock cycles per byte of text. The cipher is a pseudo...
Phillip Rogaway, Don Coppersmith
SIGKDD
2002
90views more  SIGKDD 2002»
15 years 3 months ago
Cryptographic Techniques for Privacy-Preserving Data Mining
Research in secure distributed computation, which was done as part of a larger body of research in the theory of cryptography, has achieved remarkable results. It was shown that n...
Benny Pinkas
IJCCBS
2010
146views more  IJCCBS 2010»
15 years 2 months ago
A meta-level true random number generator
: True random number generators (TRNGs) are extensively used in cryptography, simulations and statistics. In this work, we introduce, extend and analyse the concept of the randomis...
Bernhard Fechner, Andre Osterloh
IJISEC
2010
87views more  IJISEC 2010»
15 years 2 months ago
How to construct identity-based signatures without the key escrow problem
The inherent key escrow problem is one of the main reasons for the slow adoption of identity-based cryptography. The existing solution for mitigating the key escrow problem is by a...
Tsz Hon Yuen, Willy Susilo, Yi Mu