Sciweavers

130 search results - page 10 / 26
» How to Encrypt with a Malicious Random Number Generator
Sort
View
89
Voted
ECCC
2007
144views more  ECCC 2007»
14 years 11 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III
77
Voted
ISW
2009
Springer
15 years 6 months ago
Nonce Generators and the Nonce Reset Problem
A nonce is a cryptographic input value which must never repeat within a given context. Nonces are important for the security of many cryptographic building blocks, such as stream c...
Erik Zenner
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
15 years 4 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
ICS
2010
Tsinghua U.
15 years 9 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
99
Voted
CORR
2007
Springer
160views Education» more  CORR 2007»
14 years 11 months ago
How really effective are Multimodal Hints in enhancing Visual Target Spotting? Some evidence from a usability study
The main aim of the work presented here is to contribute to computer science advances in the multimodal usability area, in-as-much as it addresses one of the major issues relating...
Suzanne Kieffer, Noelle Carbonell