Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
: Most wireless ad hoc sensor networks are susceptible to routing level attacks, in which an adversary masquerades as a legitimate node to convince neighbouring nodes that it is th...
Jeff Janies, Chin-Tser Huang, Nathan L. Johnson, T...
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...
This paper presents a theoretical security analysis of lattice data hiding. The security depends on the secrecy of a dither signal that randomizes the codebook. If the same secret...
We propose a new cryptographic technique, Acknowledgment Compression, permitting senders of multicast data to verify that all interested parties have either received the data or l...