Sciweavers

915 search results - page 149 / 183
» Proof labeling schemes
Sort
View
TIT
2008
72views more  TIT 2008»
13 years 8 months ago
On the Construction of (Explicit) Khodak's Code and Its Analysis
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
Yann Bugeaud, Michael Drmota, Wojciech Szpankowski
MOC
1998
175views more  MOC 1998»
13 years 7 months ago
Convergence of a non-stiff boundary integral method for interfacial flows with surface tension
Boundary integral methods to simulate interfacial flows are very sensitive to numerical instabilities. In addition, surface tension introduces nonlinear terms with high order spat...
Héctor D. Ceniceros, Thomas Y. Hou
CORR
2010
Springer
70views Education» more  CORR 2010»
13 years 7 months ago
Simultaneous communication in noisy channels
A sender wishes to broadcast a message of length n over an alphabet of size k to r users, where each user i, 1 i r should be able to receive one of possible mi messages. The cha...
Amit Weinstein
CTRSA
2011
Springer
223views Cryptology» more  CTRSA 2011»
12 years 11 months ago
Expedient Non-malleability Notions for Hash Functions
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
Paul Baecher, Marc Fischlin, Dominique Schröd...
CCS
2010
ACM
13 years 8 months ago
On the soundness of authenticate-then-encrypt: formalizing the malleability of symmetric encryption
A communication channel from an honest sender A to an honest receiver B can be described as a system with three interfaces labeled A, B, and E (the adversary), respectively, where...
Ueli Maurer, Björn Tackmann