Sciweavers

31 search results - page 5 / 7
» How to Break MD5 and Other Hash Functions
Sort
View
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
14 years 1 months ago
A New Interactive Hashing Theorem
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
Iftach Haitner, Omer Reingold
IJNSEC
2008
98views more  IJNSEC 2008»
13 years 7 months ago
An Update on the Analysis and Design of NMAC and HMAC Functions
In this paper, we investigate the issues in the analysis and design of provably secure message authentication codes (MACs) Nested MAC (NMAC) and Hash based MAC (HMAC) proposed by ...
Praveen Gauravaram, Shoichi Hirose, Suganya Annadu...
TIT
2008
106views more  TIT 2008»
13 years 7 months ago
Byzantine Modification Detection in Multicast Networks With Random Network Coding
This paper gives an information theoretic approach for detecting Byzantine modifications in networks employing random linear network coding. Each exogenous source packet is augmen...
Tracey Ho, Ben Leong, Ralf Koetter, Muriel M&eacut...
FLAIRS
2007
13 years 10 months ago
Accessing XML Documents Using Semantic Meta Data in a P2P Environment
XGR (XML Data Grid) and BabelPeers are both data management systems based on distributed hash tables (DHT) that use the Pastry DHT to store data and meta data. XGR is based on the...
Dominic Battré, Felix Heine, André H...
ECCC
2007
144views more  ECCC 2007»
13 years 7 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III