Sciweavers

1414 search results - page 222 / 283
» Randomness and Universal Machines
Sort
View
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
14 years 2 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
CRYPTO
2010
Springer
171views Cryptology» more  CRYPTO 2010»
13 years 11 months ago
Credential Authenticated Identification and Key Exchange
Secure two-party authentication and key exchange are fundamental problems. Traditionally, the parties authenticate each other by means of their identities, using a public-key infr...
Jan Camenisch, Nathalie Casati, Thomas Groß,...
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
13 years 11 months ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger
TIT
2008
81views more  TIT 2008»
13 years 9 months ago
How to Filter an "Individual Sequence With Feedback"
We consider causally estimating (filtering) the components of a noise-corrupted sequence relative to a reference class of filters. The noiseless sequence to be filtered is designe...
Tsachy Weissman
TCS
2002
13 years 9 months ago
Process algebra for performance evaluation
This paper surveys the theoretical developments in the field of stochastic process algebras, process algebras where action occurrences may be subject to a delay that is determined...
Holger Hermanns, Ulrich Herzog, Joost-Pieter Katoe...