In 1949, Shannon proved the perfect secrecy of the Vernam cryptographic system (One-Time Pad or OTP). It has generally been believed that the perfectly random and uncompressible O...
This brief revisits the problem of conversion between number systems and asks the following question: given a nonnegative decimal number , what is the value of the digit at positio...
Mobile software agents are an increasingly important programming model within the World Wide Web (WWW). Typically programmed in Java or another machine- independent language, the ...
Sanitizable signature schemes, as defined by Ateniese et al. (ESORICS 2005), allow a signer to partly delegate signing rights to another party, called the sanitizer. That is, the s...
Anja Lehmann, Christina Brzuska, Dominique Schr&ou...
We re-visit the problem of secure multiparty set intersection in information theoretic settings. In [16], Li et.al have proposed a protocol for multiparty set intersection problem...