Sciweavers

17049 search results - page 3308 / 3410
» cans 2007
Sort
View
87
Voted
CP
2007
Springer
15 years 4 months ago
Scheduling for Cellular Manufacturing
Abstract. Alcatel-Lucent is a major player in the eld of telecommunications. One of the products it oers to network operators is wireless infrastructure such as base stations. Su...
Roman van der Krogt, James Little, Kenneth Pulliam...
CP
2007
Springer
15 years 4 months ago
Tradeoffs in the Complexity of Backdoor Detection
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...
88
Voted
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
15 years 4 months ago
On Secure Multi-party Computation in Black-Box Groups
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
CSR
2007
Springer
15 years 4 months ago
Proving Church's Thesis
t) Yuri Gurevich Microsoft Research The talk reflects recent joint work with Nachum Dershowitz [4]. In 1936, Church suggested that the recursive functions, which had been defined...
Yuri Gurevich
CTRSA
2007
Springer
146views Cryptology» more  CTRSA 2007»
15 years 4 months ago
How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
« Prev « First page 3308 / 3410 Last » Next »