Sciweavers

330 search results - page 9 / 66
» On the Notion of Pseudo-Free Groups
Sort
View
80
Voted
PKC
2010
Springer
183views Cryptology» more  PKC 2010»
15 years 1 months ago
Unlinkability of Sanitizable Signatures
Sanitizable signatures allow a designated party, called the sanitizer, to modify parts of signed data such that the immutable parts can still be verified with respect to the origi...
Christina Brzuska, Marc Fischlin, Anja Lehmann, Do...
PKC
2012
Springer
237views Cryptology» more  PKC 2012»
13 years 1 days ago
Relatively-Sound NIZKs and Password-Based Key-Exchange
We define a new notion of relatively-sound non-interactive zeroknowledge (NIZK) proofs, where a private verifier with access to a trapdoor continues to be sound even when the Ad...
Charanjit S. Jutla, Arnab Roy
VR
1999
IEEE
123views Virtual Reality» more  VR 1999»
15 years 1 months ago
Leadership and Collaboration in Shared Virtual Environments
We present an experiment that investigates the behaviour of small groups of participants in a wide-area distributed collaborative virtual environment (CVE). This is the third and ...
Anthony Steed, Mel Slater, Amela Sadagic, Adrian B...
VLDB
1991
ACM
101views Database» more  VLDB 1991»
15 years 1 months ago
Solving Domain Mismatch and Schema Mismatch Problems with an Object-Oriented Database Programming Language
Domain mismatch and schema mismatch are two of the important semantic integration problems for interoperating heterogeneous databases. This paper structures the domain mismatch pr...
William Kent
ESA
2010
Springer
248views Algorithms» more  ESA 2010»
14 years 10 months ago
The Robustness of Level Sets
We define the robustness of a level set homology class of a function f : X R as the magnitude of a perturbation necessary to kill the class. Casting this notion into a group theor...
Paul Bendich, Herbert Edelsbrunner, Dmitriy Morozo...