Sciweavers

1792 search results - page 329 / 359
» What Are We Arguing About
Sort
View
FPGA
2004
ACM
119views FPGA» more  FPGA 2004»
14 years 1 months ago
A quantitative analysis of the speedup factors of FPGAs over processors
The speedup over a microprocessor that can be achieved by implementing some programs on an FPGA has been extensively reported. This paper presents an analysis, both quantitative a...
Zhi Guo, Walid A. Najjar, Frank Vahid, Kees A. Vis...
TCC
2004
Springer
147views Cryptology» more  TCC 2004»
14 years 1 months ago
Computational Collapse of Quantum State with Application to Oblivious Transfer
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...
Claude Crépeau, Paul Dumais, Dominic Mayers...
NDSS
2003
IEEE
14 years 29 days ago
Proactive Two-Party Signatures for User Authentication
We study proactive two-party signature schemes in the context of user authentication. A proactive two-party signature scheme (P2SS) allows two parties—the client and the serverâ...
Antonio Nicolosi, Maxwell N. Krohn, Yevgeniy Dodis...
MPC
2010
Springer
174views Mathematics» more  MPC 2010»
13 years 11 months ago
Matrices as Arrows!
cting programs and point-free abstraction [2]. In order to automatically generate the fast running code there was the need to use matrix product as the basic matrix composition ope...
Hugo Daniel Macedo, José Nuno Oliveira
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III