Sciweavers

1190 search results - page 25 / 238
» Secure off-the-record messaging
Sort
View
CCS
2009
ACM
15 years 8 months ago
Multi-party off-the-record messaging
Most cryptographic algorithms provide a means for secret and authentic communication. However, under many circumstances, the ability to repudiate messages or deny a conversation i...
Ian Goldberg, Berkant Ustaoglu, Matthew Van Gundy,...
SP
2006
IEEE
109views Security Privacy» more  SP 2006»
15 years 8 months ago
Integrity (I) Codes: Message Integrity Protection and Authentication Over Insecure Channels
Inspired by unidirectional error detecting codes that are used in situations where only one kind of bit errors are possible (e.g., it is possible to change a bit “0” into a bi...
Mario Cagalj, Jean-Pierre Hubaux, Srdjan Capkun, R...
ICDCSW
2005
IEEE
15 years 7 months ago
Increasing Attack Resiliency of Wireless Ad Hoc and Sensor Networks
An ad hoc or sensor network that is employed for security sensitive applications is expected to tolerate a certain quantity of maliciously behaving nodes. Algorithms must be desig...
Harald Vogt
119
Voted
CCS
2006
ACM
15 years 5 months ago
Ring signatures without random oracles
Since the formalization of ring signature by Rivest, Shamir and Tauman in 2001, there are lots of variations appeared in the literature. Almost all of the variations rely on the ra...
Sherman S. M. Chow, Victor K.-W. Wei, Joseph K. Li...
136
Voted
FSE
1997
Springer
246views Cryptology» more  FSE 1997»
15 years 5 months ago
Fast Message Authentication Using Efficient Polynomial Evaluation
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
Valentine Afanassiev, Christian Gehrmann, Ben J. M...