Sciweavers

534 search results - page 51 / 107
» One more bit is enough
Sort
View
CRYPTO
2011
Springer
195views Cryptology» more  CRYPTO 2011»
12 years 7 months ago
Time-Lock Puzzles in the Random Oracle Model
Abstract. A time-lock puzzle is a mechanism for sending messages “to the future”. The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until e...
Mohammad Mahmoody, Tal Moran, Salil P. Vadhan
TCC
2009
Springer
146views Cryptology» more  TCC 2009»
14 years 8 months ago
An Optimally Fair Coin Toss
We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common u...
Tal Moran, Moni Naor, Gil Segev
ARITH
2007
IEEE
14 years 2 months ago
Worst Cases of a Periodic Function for Large Arguments
One considers the problem of finding hard to round cases of a periodic function for large floating-point inputs, more precisely when the function cannot be efficiently approxim...
Guillaume Hanrot, Vincent Lefèvre, Damien S...
FTTCS
2006
106views more  FTTCS 2006»
13 years 8 months ago
Algorithmic Results in List Decoding
Error-correcting codes are used to cope with the corruption of data by noise during communication or storage. A code uses an encoding procedure that judiciously introduces redunda...
Venkatesan Guruswami
DNA
2011
Springer
233views Bioinformatics» more  DNA 2011»
12 years 7 months ago
Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems
We study the potential for molecule recycling in chemical reaction systems and their DNA strand displacement realizations. Recycling happens when a product of one reaction is a rea...
Anne Condon, Alan J. Hu, Ján Manuch, Chris ...