Sciweavers

1628 search results - page 145 / 326
» Compiler Construction Using Scheme
Sort
View
167
Voted
CRYPTO
1997
Springer
169views Cryptology» more  CRYPTO 1997»
15 years 10 months ago
Deniable Encryption
Consider a situation in which the transmission of encrypted messages is intercepted by an adversary who can later ask the sender to reveal the random choices and also the secret ...
Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostr...
CORR
2007
Springer
90views Education» more  CORR 2007»
15 years 6 months ago
Rateless coding with partial state information at the decoder
The problem of coding for channels with time-varying state is studied. Two different models are considered: one in which the channel state cannot depend on the transmitted signal,...
Anand D. Sarwate, Michael Gastpar
TON
2008
89views more  TON 2008»
15 years 4 months ago
Simple summaries for hashing with choices
In a multiple-choice hashing scheme, each item is stored in one of 2 possible hash table buckets. The availability of these multiple choices allows for a substantial reduction in t...
Adam Kirsch, Michael Mitzenmacher
147
Voted
MONET
2007
110views more  MONET 2007»
15 years 5 months ago
Multi-hop Clustering Based on Neighborhood Benchmark in Mobile Ad-hoc Networks
— Large-scale mobile ad-hoc networks require flexible and stable clustered network structure for efficient data collection and dissemination. In this paper, a scheme is present...
Stephen S. Yau, Wei Gao
149
Voted
IACR
2011
124views more  IACR 2011»
14 years 5 months ago
Generic Fully Simulatable Adaptive Oblivious Transfer
We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable security, from various well-known assumptions such as DDH, d-Linear, QR, DCR, and LWE. To t...
Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong