305 search results - page 2 / 61 » From Sets to Bits in Coq |
188
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
146
click to vote
CHES
2008
Springer
15 years 8 months ago
2008
Springer
Bit-slicing is a non-conventional implementation technique for cryptographic software where an n-bit processor is considered as a collection of n 1-bit execution units operating in...
144
click to vote
ASIACRYPT
2010
Springer
15 years 4 months ago
2010
Springer
We study security amplification for weak bit-commitment schemes and improve the efficiency of (black-box) transformations in both the information-theoretic and computational setti...
177
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
138
click to vote
FOCS
2009
IEEE
16 years 24 days ago
2009
IEEE
We give an explicit construction of an -biased set over k bits of size O k 2 log(1/ ) 5/4 . This improves upon previous explicit constructions when is roughly (ignoring logarith