Sciweavers

1190 search results - page 12 / 238
» Secure off-the-record messaging
Sort
View
CRYPTO
2006
Springer
159views Cryptology» more  CRYPTO 2006»
15 years 9 months ago
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
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...
Saurabh Agarwal, Ronald Cramer, Robbert de Haan
IJSNET
2007
91views more  IJSNET 2007»
15 years 5 months ago
SUMP: a secure unicast messaging protocol for wireless ad hoc sensor networks
: 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...
ECCC
2000
93views more  ECCC 2000»
15 years 5 months ago
Security of the Most Significant Bits of the Shamir Message Passing Scheme
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...
Maria Isabel Gonzalez Vasco, Igor Shparlinski
MMSEC
2006
ACM
132views Multimedia» more  MMSEC 2006»
15 years 12 months ago
On achievable security levels for lattice data hiding in the known message attack scenario
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...
Luis Pérez-Freire, Fernando Pérez-Go...
IPTPS
2004
Springer
15 years 11 months ago
Secure Acknowledgment of Multicast Messages in Open Peer-to-Peer Networks
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...
Antonio Nicolosi, David Mazières