Indifferentiability Characterization of Hash Functions and Optimal Bounds of Popular Domain Extensions Rishiraj Bhattacharyya1 , Avradip Mandal2 , and Mridul Nandi3 1 Applied Statistics Unit, Indian Statistical Institut

Source URL: www.isical.ac.in

Push-to-Pull Peer-to-Peer Live Streaming Thomas Locher, Remo Meier, Stefan Schmid, and Roger Wattenhofer Computer Engineering and Networks Laboratory (TIK), ETH Zurich, 8092 Zurich, Switzerland {lochert,remmeier,schmiste

Source URL: dcg.ethz.ch

• File sharing
• Distributed data storage
• Network architecture
• Peer-to-peer
• Distributed hash table
• Hash list
• Clientserver model
• Tiny Encryption Algorithm

Characterization of Padding Rules and Different Variants of MD Hash Functions Mridul Nandi National Institute of Standards and Technology

Source URL: www.isical.ac.in

Cryptanalysis of the 10-Round Hash and Full Compression Function of SHAvite-3-512 ¨ Leurent2 , Florian Mendel3 , Mar´ıa Praveen Gauravaram1 , Gaeten 4

Source URL: 2010.africacrypt.com

Leftover Hash Lemma, Revisited Boaz Barak ∗ Yevgeniy Dodis†

Source URL: www.uclouvain.be

Data Discovery and Dissemination with DIP tinyos-2.x/tos/lib/net/dip Kaisen Lin UC San Diego

Source URL: sing.stanford.edu

• Information retrieval
• Hashing
• Error detection and correction
• Information science
• Computer programming
• Cryptographic hash functions
• Search algorithms
• Distributed data storage
• Bloom filter
• Hash function
• Hash list
• Trie

Very-efficient simulatable flipping of many coins into a well (and a new very-efficient extractable-and-equivocable commitment scheme) Luís T. A. N. Brandão∗ (Technical report – June 28, Abstract. Secure two

Source URL: eprint.iacr.org

• Cryptography
• Public-key cryptography
• Commitment scheme
• Secret sharing
• Zero-knowledge proof
• Cryptographic hash function
• Coin flipping
• Universal composability
• Cryptographic primitive
• One-way function
• Claw-free permutation
• RSA

Appears in Proceedings of the 11th IEEE International Conference on Network Protocols (ICNPExploiting Routing Redundancy via Structured Peer-to-Peer Overlays Ben Y. Zhao, Ling Huang, Jeremy Stribling, Anthony D.

Source URL: www.cs.ucsb.edu

• Distributed data storage
• Tapestry
• Routing
• Overlay network
• Pastry
• Dynamic routing
• Peer-to-peer
• Chord
• Distributed hash table
• Content addressable network

Handling Churn in a DHT Sean Rhea, Dennis Geels, Timothy Roscoe, and John Kubiatowicz University of California, Berkeley and Intel Research, Berkeley {srhea,geels,kubitron}@cs.berkeley.edu,

Source URL: www.oceanstore.org

• Distributed data storage
• Computing
• Concurrent computing
• Distributed computing
• Distributed hash table
• Kademlia
• Pastry
• Chord
• Routing
• Peer-to-peer
• Overlay network
• Tapestry

Introduction Early Applications to Block Ciphers Preimages of Hash Functions

Source URL: web.spms.ntu.edu.sg