Sciweavers

7796 search results - page 151 / 1560
» On Generalized Schur Numbers
Sort
View
ASIACRYPT
2000
Springer
15 years 11 months ago
Addition of ElGamal Plaintexts
Abstract. We introduce an efficient method for performing computation on encrypted data, allowing addition of ElGamal encrypted plaintexts. We demonstrate a solution that is robust...
Markus Jakobsson, Ari Juels
EUROCRYPT
1999
Springer
15 years 10 months ago
Lower Bounds for Oblivious Transfer Reductions
We prove the first general and non-trivial lower bound for the number of times a 1-out-of-n Oblivious Transfer of strings of length should be invoked so as to obtain, by an inform...
Yevgeniy Dodis, Silvio Micali
LATIN
2000
Springer
15 years 10 months ago
Approximation Algorithms for Flexible Job Shop Problems
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...
COMPGEOM
1995
ACM
15 years 10 months ago
On Conway's Thrackle Conjecture
A thrackle is a graph drawn in the plane so that its edges are represented by Jordan arcs and any two distinct arcs either meet at exactly one common vertex or cross at exactly on...
László Lovász, János P...
CRYPTO
1991
Springer
105views Cryptology» more  CRYPTO 1991»
15 years 10 months ago
Universal Hashing and Authentication Codes
In this paper, we study the application of universal hashingto the construction of unconditionally secure authentication codes without secrecy. This idea is most useful when the nu...
Douglas R. Stinson