Sciweavers

64 search results - page 7 / 13
» Proxy Cryptography Revisited
Sort
View
IJNSEC
2008
92views more  IJNSEC 2008»
13 years 7 months ago
Re-visiting the One-Time Pad
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...
Nithin Nagaraj, Vivek Vaidya, Prabhakar G. Vaidya
MSV
2004
13 years 9 months ago
On the Conversion between Number Systems
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...
Houssain Kettani
WWW
2001
ACM
14 years 8 months ago
Integrating Software Agents into the HTTP Caching Infrastructure
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 ...
Jesse Greenwald, Daniel Andresen
PKC
2009
Springer
180views Cryptology» more  PKC 2009»
14 years 8 months ago
Security of Sanitizable Signatures Revisited
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...
SACRYPT
2009
Springer
150views Cryptology» more  SACRYPT 2009»
14 years 2 months ago
Information Theoretically Secure Multi Party Set Intersection Re-visited
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...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan