Sciweavers

849 search results - page 57 / 170
» Completely Non-malleable Schemes
Sort
View
ICDCS
2005
IEEE
15 years 6 months ago
Scalable, Server-Passive, User-Anonymous Timed Release Cryptography
We consider the problem of sending messages into the future, commonly known as timed release cryptography. Existing schemes for this task either solve the relative time problem wi...
Aldar C.-F. Chan, Ian F. Blake
113
Voted
GLOBECOM
2009
IEEE
15 years 3 months ago
Fast Admission Control for Short TCP Flows
—Over the last decade, numerous admission control schemes have been studied to allocate network resources. Although per-flow control schemes can provide guaranteed QoS, such sch...
Yingxin Jiang, Aaron Striegel
99
Voted
CN
2004
102views more  CN 2004»
15 years 12 days ago
Comparing economic incentives in peer-to-peer networks
Users who join a peer-to-peer network have, in general, suboptimal incentives to contribute to the network, because of the externalities that exist between them. The result is an ...
Panayotis Antoniadis, Costas Courcoubetis, Robin M...
189
Voted
SIGMOD
2006
ACM
153views Database» more  SIGMOD 2006»
16 years 21 days ago
Interactive query formulation over web service-accessed sources
Integration systems typically support only a restricted set of queries over the schema they export. The reason is that the participating information sources contribute limited con...
Michalis Petropoulos, Alin Deutsch, Yannis Papakon...
105
Voted
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 1 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs