Sciweavers

10054 search results - page 1839 / 2011
» On the Complexity of Function Learning
Sort
View
CRYPTO
2003
Springer
132views Cryptology» more  CRYPTO 2003»
15 years 9 months ago
On Cryptographic Assumptions and Challenges
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
Moni Naor
ICCSA
2003
Springer
15 years 9 months ago
Optimization in the Context of Active Control of Sound
A problem of eliminating the unwanted time-harmonic noise on a predetermined region of interest is solved by active means, i.e., by introducing the additional sources of sound, cal...
Josip Loncaric, Semyon Tsynkov
CSFW
2002
IEEE
15 years 9 months ago
Security Protocol Design via Authentication Tests
We describe a protocol design process, and illustrate its use by creating ATSPECT, an Authentication Test-based Secure Protocol for Electronic Commerce Transactions. The design pr...
Joshua D. Guttman
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
15 years 8 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
SAC
2009
ACM
15 years 8 months ago
Towards "WYDIWYS" for MIMI using concept analysis
This paper presents a novel software engineering approach for developing a dynamic web interface that meets the quality criterion of “WYDIWYS” - What You Do Is What You See. T...
Jie Dai, Remo Mueller, Jacek Szymanski, Guo-Qiang ...
« Prev « First page 1839 / 2011 Last » Next »