Sciweavers

117 search results - page 20 / 24
» A Comparison of Cryptography Courses
Sort
View
IADIS
2004
13 years 8 months ago
Relevance feedback using semantic association between indexing terms in large free text corpuses
Relevance feedback has been considered as a means of incorporating learning into information retrieval systems for quite sometime now. This paper discusses the research results of...
Shahzad Khan, Kenan Azam
WSC
1997
13 years 8 months ago
Forecasting Investment Opportunities Through Dynamic Simulation
Outcomes of this modeling research are the ability to facilitate comparisons of investment alternatives or strategies; regarding primary targets, possible annual revenues, promoti...
Stephen R. Parker
ACNS
2009
Springer
168views Cryptology» more  ACNS 2009»
14 years 2 months ago
How to Extract and Expand Randomness: A Summary and Explanation of Existing Results
Abstract. We examine the use of randomness extraction and expansion in key agreement (KA) protocols to generate uniformly random keys in the standard model. Although existing works...
Yvonne Cliff, Colin Boyd, Juan Manuel Gonzá...
FDTC
2009
Springer
126views Cryptology» more  FDTC 2009»
14 years 2 months ago
WDDL is Protected against Setup Time Violation Attacks
—In order to protect crypto-systems against side channel attacks various countermeasures have been implemented such as dual-rail logic or masking. Faults attacks are a powerful t...
Nidhal Selmane, Shivam Bhasin, Sylvain Guilley, Ta...
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
14 years 8 days ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain