Sciweavers

95 search results - page 7 / 19
» Fast Multiparty Multiplications from shared bits
Sort
View
ACSAC
2010
IEEE
13 years 7 months ago
Fast and practical instruction-set randomization for commodity systems
Instruction-set randomization (ISR) is a technique based on randomizing the "language" understood by a system to protect it from code-injection attacks. Such attacks wer...
Georgios Portokalidis, Angelos D. Keromytis
INFOCOM
2011
IEEE
13 years 1 months ago
Fast and scalable secret key generation exploiting channel phase randomness in wireless networks
—Recently, there has been great interest in physical layer security techniques that exploit the randomness of wireless channels for securely extracting cryptographic keys. Severa...
Qian Wang, Hai Su, Kui Ren, Kwangjo Kim
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
13 years 9 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
ATAL
2009
Springer
14 years 2 months ago
Adding incentives to file-sharing systems
Modern peer-to-peer file sharing systems rely heavily on the willingness of users to distribute files to others. A selfish user can choose to download a file and consume resou...
Aviv Zohar, Jeffrey S. Rosenschein
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
14 years 1 months ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Xin He, Ming-Yang Kao, Hsueh-I Lu