Sciweavers

2492 search results - page 34 / 499
» On the General Signature Trees
Sort
View
ASIACRYPT
2006
Springer
13 years 11 months ago
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
Jens Groth
DBPL
2007
Springer
158views Database» more  DBPL 2007»
13 years 11 months ago
Efficient Algorithms for the Tree Homeomorphism Problem
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...
Michaela Götz, Christoph Koch, Wim Martens
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
13 years 8 months ago
Behavior-based speciation for evolutionary robotics
This paper describes a speciation method that allows an evolutionary process to learn several robot behaviors using a single execution. Species are created in behavioral space in ...
Leonardo Trujillo, Gustavo Olague, Evelyne Lutton,...
NDSS
1998
IEEE
13 years 12 months ago
Efficient Protocols for Signing Routing Messages
In this work, we aim to reduce the computational costs of using public-key digital signatures in securing routing protocols. Two protocols (COSP and IOSP) using one-time digitalsi...
Kan Zhang
ACMSE
2009
ACM
13 years 5 months ago
A secure unidirectional proxy re-encryption using identity and secret key exchange
Proxy re-encryption, abbreviated as PRE, is a cryptosystem which allows the proxy to re-encrypt a cirphertext without accessing the underlying message. The re-encryption protocol ...
Edna Milgo