Sciweavers

95 search results - page 4 / 19
» Fast Multiparty Multiplications from shared bits
Sort
View
INFOCOM
2010
IEEE
13 years 8 months ago
Exploiting Multiple-Antenna Diversity for Shared Secret Key Generation in Wireless Networks
—Generating a secret key between two parties by extracting the shared randomness in the wireless fading channel is an emerging area of research. Previous works focus mainly on si...
Kai Zeng, Daniel Wu, An Chan, Prasant Mohapatra
IJES
2008
102views more  IJES 2008»
13 years 9 months ago
Alternative application-specific processor architectures for fast arbitrary bit permutations
Block ciphers are used to encrypt data and provide data confidentiality. For interoperability reasons, it is desirable to support a variety of block ciphers efficiently. Of the bas...
Zhijie Jerry Shi, Xiao Yang, Ruby B. Lee
TIT
2008
74views more  TIT 2008»
13 years 9 months ago
Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication
A certain modular representation of multilinear polynomials is considered. The modulo 6 representation of polynomial f is just any polynomial f + 6g. The 1-a-strong representation ...
Vince Grolmusz
IACR
2011
111views more  IACR 2011»
12 years 9 months ago
Secure Multi-Party Sorting and Applications
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
Kristján Valur Jónsson, Gunnar Kreit...
ADHOCNOW
2008
Springer
14 years 4 months ago
Adapting BitTorrent to Wireless Ad Hoc Networks
Abstract. BitTorrent is one of the Internet’s most efficient content distribution protocols. It is known to perform very well over the wired Internet where end-to-end performance...
Mohamed Karim Sbai, Chadi Barakat, Jaeyoung Choi, ...