Sciweavers

1898 search results - page 140 / 380
» Weak Keys for IDEA
Sort
View
ICITS
2009
13 years 6 months ago
On the Security of Pseudorandomized Information-Theoretically Secure Schemes
In this article, we discuss a naive method of randomness reduction for cryptographic schemes, which replaces the required perfect randomness with output distribution of a computat...
Koji Nuida, Goichiro Hanaoka
ICC
2011
IEEE
206views Communications» more  ICC 2011»
12 years 8 months ago
Unveiling the Content-Centric Features of TCP
—Content-centric networking has been proposed as a new networking paradigm that is centered around the distribution of content. A key idea of content-centric networks is to addre...
Suman Srinivasan, Ivica Rimac, Volker Hilt, Moritz...
SIGIR
2012
ACM
11 years 11 months ago
Frontiers, challenges, and opportunities for information retrieval: Report from SWIRL 2012 the second strategic workshop on info
During a three-day workshop in February 2012, 45 Information Retrieval researchers met to discuss long-range challenges and opportunities within the field. The result of the works...
James Allan, W. Bruce Croft, Alistair Moffat, Mark...
KBSE
1995
IEEE
14 years 15 days ago
A Model for Decision Maintenance in the WinWin Collaboration Framework
Cost-effective engineering and evolution of complex software must involve the different stakeholders concurrently and collaboratively. The hard problem is providing computer suppo...
Prasanta K. Bose
TCS
2002
13 years 8 months ago
Authentication tests and the structure of bundles
Suppose a principal in a cryptographic protocol creates and transmits a message containing a new value v, later receiving v back in a different cryptographic context. It can concl...
Joshua D. Guttman, F. Javier Thayer