1209 search results - page 85 / 242 » Universal Algebra and Computer Science |
115
click to vote
LATINCRYPT
2010
15 years 29 days ago
2010
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
114
click to vote
WECWIS
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper, we report our experience in the implementation of a module for creating user profiles of Web visitors by using Zones, Weights and Actions. The module is part of Gug...
106
Voted
SOFSEM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Anonymous communication with onions requires that a user application determines the whole routing path of an onion. This scenario has certain disadvantages, it might be d...
120
click to vote
SCCC
2002
IEEE
15 years 7 months ago
2002
IEEE
The distribution of keys by a hash function as used in hash search with chaining is studied by considering the distribution of keys a random function from keys to buckets would gi...
116
click to vote
CSEE
2001
Springer
15 years 7 months ago
2001
Springer
This paper presents an approach to incorporate PSP into a traditional Software Engineering course that is typically contained within a Computer Science curriculum. Advantages and ...