5606 search results - page 907 / 1122 » Randomization Techniques for Graphs. |
175
click to vote
ASIACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
171
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Traders in electronic marketplaces may behave dishonestly, cheating other agents. A multitude of trust and reputation systems have been proposed to try to cope with the problem of...
168
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
We consider the coverage testing problem where we are given a document and a corpus with a limited query interface and asked to find if the corpus contains a near-duplicate of th...
172
click to vote
CRYPTO
2009
Springer
16 years 1 months ago
2009
Springer
We consider two-party quantum protocols starting with a transmission of some random BB84 qubits followed by classical messages. We show a general “compiler” improving the secur...
183
click to vote
ASPDAC
2009
ACM
16 years 1 months ago
2009
ACM
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...