Sciweavers

893 search results - page 66 / 179
» Descent Theory for Schemes
Sort
View
EUROCRYPT
2012
Springer
13 years 2 months ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
15 years 5 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith
TON
2008
107views more  TON 2008»
14 years 11 months ago
Efficient routing in intermittently connected mobile networks: the multiple-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
SCIA
2005
Springer
15 years 5 months ago
Optimal Estimation of Homogeneous Vectors
Estimation of inhomogeneous vectors is well-studied in estimation theory. For instance, given covariance matrices of input data allow to compute optimal estimates and characterize...
Matthias Mühlich, Rudolf Mester
IMC
2004
ACM
15 years 5 months ago
Identifying elephant flows through periodically sampled packets
Identifying elephant flows is very important in developing effective and efficient traffic engineering schemes. In addition, obtaining the statistics of these flows is also ver...
Tatsuya Mori, Masato Uchida, Ryoichi Kawahara, Jia...