Sciweavers

233 search results - page 45 / 47
» Interactive Proofs For Quantum Computations
Sort
View
ICS
2010
Tsinghua U.
14 years 3 months ago
Non-Malleable Codes
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...
WMCSA
2009
IEEE
14 years 24 days ago
A case for application aware channel access in wireless networks
The increasing reliance of users on wireless networks for Internet connectivity has posed two significant challenges for mobile networking research. The first challenge is to pr...
Ashish Sharma, Elizabeth M. Belding
TLCA
2009
Springer
14 years 18 days ago
Parametricity for Haskell with Imprecise Error Semantics
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...
Florian Stenger, Janis Voigtländer
SIGMOD
1995
ACM
116views Database» more  SIGMOD 1995»
13 years 9 months ago
Incremental Maintenance of Views with Duplicates
We study the problem of e cient maintenance of materialized views that may contain duplicates. This problem is particularly important when queries against such views involve aggre...
Timothy Griffin, Leonid Libkin
ASIACRYPT
2008
Springer
13 years 8 months ago
Universally Composable Adaptive Oblivious Transfer
In an oblivious transfer (OT) protocol, a Sender with messages M1, . . . , MN and a Receiver with indices 1, . . . , k [1, N] interact in such a way that at the end the Receiver ...
Matthew Green, Susan Hohenberger