Sciweavers

340 search results - page 26 / 68
» Cryptography: An Art and Science
Sort
View
TCS
2010
14 years 4 months ago
Bounds on the efficiency of black-box commitment schemes
Constructions of cryptographic primitives based on general assumptions (e.g., one-way functions) tend to be less efficient than constructions based on specific (e.g., number-theor...
Omer Horvitz, Jonathan Katz
ENTCS
2007
124views more  ENTCS 2007»
14 years 9 months ago
Blues for Gary: Design Abstractions for a Jazz Improvisation Assistant
bstractions for a Jazz Improvisation Assistant Robert Keller1 Martin Hunt, Stephen Jones, David Morrison, Aaron Wolin Computer Science Harvey Mudd College Claremont, California, US...
Robert Keller, Martin Hunt, Stephen Jones, David M...
MOBIHOC
2005
ACM
15 years 9 months ago
An efficient scheme for authenticating public keys in sensor networks
With the advance of technology, Public Key Cryptography (PKC) will sooner or later be widely used in wireless sensor networks. Recently, it has been shown that the performance of ...
Wenliang Du, Ronghua Wang, Peng Ning
TCC
2004
Springer
147views Cryptology» more  TCC 2004»
15 years 2 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...
ICCD
2007
IEEE
206views Hardware» more  ICCD 2007»
15 years 6 months ago
SCAFFI: An intrachip FPGA asynchronous interface based on hard macros
Building fully synchronous VLSI circuits is becoming less viable as circuit geometries evolve. However, before the adoption of purely asynchronous strategies in VLSI design, globa...
Julian J. H. Pontes, Rafael Soares, Ewerson Carval...