Sciweavers

9997 search results - page 349 / 2000
» The case for crowd computing
Sort
View
ALT
1998
Springer
15 years 11 months ago
Synthesizing Learners Tolerating Computable Noisy Data
An index for an r.e. class of languages (by definition) generates a sequence of grammars defining the class. An index for an indexed family of recursive languages (by definition) ...
John Case, Sanjay Jain
EUROCRYPT
2008
Springer
15 years 8 months ago
Efficient Two Party and Multi Party Computation Against Covert Adversaries
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
Vipul Goyal, Payman Mohassel, Adam Smith
CCS
2010
ACM
15 years 7 months ago
TASTY: tool for automating secure two-party computations
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
Wilko Henecka, Stefan Kögl, Ahmad-Reza Sadegh...
SIGCSE
2008
ACM
192views Education» more  SIGCSE 2008»
15 years 6 months ago
Enhancing learning management systems to better support computer science education
Many individual instructors--and, in some cases, entire universities--are gravitating towards the use of comprehensive learning management systems (LMSs), such as Blackboard and M...
Guido Rößling, Mike Joy, Andrés ...
FOCS
2009
IEEE
16 years 1 months ago
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
Yael Tauman Kalai, Xin Li, Anup Rao