Sciweavers

773 search results - page 61 / 155
» On Cryptographic Assumptions and Challenges
Sort
View
121
Voted
COGSCI
2011
31views more  COGSCI 2011»
15 years 1 months ago
Looking in the Wrong Direction Correlates With More Accurate Word Learning
Previous research on lexical development has aimed to identify the factors that enable accurate initial word-referent mappings based on the assumption that the accuracy of initial...
Stanka A. Fitneva, Morten H. Christiansen
DAC
2004
ACM
16 years 7 months ago
Security as a new dimension in embedded system design
The growing number of instances of breaches in information security in the last few years has created a compelling case for efforts towards secure electronic systems. Embedded sys...
Srivaths Ravi, Paul C. Kocher, Ruby B. Lee, Gary M...
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
16 years 6 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
STOC
2006
ACM
120views Algorithms» more  STOC 2006»
16 years 6 months ago
Black-box constructions for secure computation
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...
ACNS
2009
Springer
168views Cryptology» more  ACNS 2009»
16 years 22 days 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á...