88 search results - page 18 / 18 » Reducing hard SAT instances to polynomial ones |
TCC
2004
Springer
13 years 10 months ago
2004
Springer
Quantum 2-party cryptography differs from its classical counterpart in at least one important way: Given blak-box access to a perfect commitment scheme there exists a secure 1−2...
ALGOSENSORS
2009
Springer
13 years 12 months ago
2009
Springer
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
ASIACRYPT
2009
Springer
13 years 12 months ago
2009
Springer
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...