Sciweavers

9997 search results - page 102 / 2000
» The case for crowd computing
Sort
View
EUROCRYPT
2011
Springer
14 years 1 months ago
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
Abstract. NTRUEncrypt, proposed in 1996 by Hostein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic perfor...
Damien Stehlé, Ron Steinfeld
ANTS
2006
Springer
95views Algorithms» more  ANTS 2006»
15 years 1 months ago
Computing Pro-P Galois Groups
We describe methods for explicit computation of Galois groups of certain tamely ramified p-extensions. In the finite case this yields a short list of candidates for the Galois grou...
Nigel Boston, Harris Nover
CORR
2006
Springer
151views Education» more  CORR 2006»
14 years 10 months ago
A general computation rule for lossy summaries/messages with examples from equalization
Abstract-- Elaborating on prior work by Minka, we formulate a general computation rule for lossy messages. An important special case (with many applications in communications) is t...
Junli Hu, Hans-Andrea Loeliger, Justin Dauwels, Fr...
CRYPTO
2006
Springer
149views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
In the setting of multiparty computation, a set of parties wish to jointly compute a function of their inputs, while preserving security in the case that some subset of them are co...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...
SIGCSE
2010
ACM
187views Education» more  SIGCSE 2010»
15 years 3 months ago
Game-themed programming assignments for faculty: a case study
Despite the proven success of using computer video games as a context for teaching introductory programming (CS1/2) courses, barriers including the lack of adoptable materials, re...
Cinnamon Hillyard, Robin Angotti, Michael Panitz, ...