Sciweavers

12 search results - page 2 / 3
» Constructing Quantum Network Coding Schemes from Classical N...
Sort
View
EUROCRYPT
1995
Springer
13 years 8 months ago
Quantum Oblivious Mutual Identification
We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and e...
Claude Crépeau, Louis Salvail
INFOCOM
2012
IEEE
11 years 7 months ago
Experimental performance comparison of Byzantine Fault-Tolerant protocols for data centers
Abstract—In this paper, we implement and evaluate three different Byzantine Fault-Tolerant (BFT) state machine replication protocols for data centers: (1) BASIC: The classic solu...
Guanfeng Liang, Benjamin Sommer, Nitin H. Vaidya
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 8 days ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 5 months ago
Index coding via linear programming
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
Anna Blasiak, Robert D. Kleinberg, Eyal Lubetzky
TIFS
2008
154views more  TIFS 2008»
13 years 5 months ago
On the Distinguishability of Distance-Bounded Permutations in Ordered Channels
Ordered channels, such as those provided by Internet protocol and transmission control protocol protocols, rely on sequence numbers to recover from packet reordering due to network...
Juan M. Estévez-Tapiador, Julio Césa...