Sciweavers

597 search results - page 3 / 120
» Homomorphisms of random paths
Sort
View
PKC
2011
Springer
219views Cryptology» more  PKC 2011»
14 years 12 days ago
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
Dan Boneh, David Mandell Freeman
PVLDB
2010
110views more  PVLDB 2010»
14 years 8 months ago
Graph Homomorphism Revisited for Graph Matching
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Hongzhi Wang, ...
RANDOM
1998
Springer
15 years 1 months ago
Randomized Lower Bounds for Online Path Coloring
Stefano Leonardi, Andrea Vitaletti
ASIACRYPT
2009
Springer
15 years 1 months ago
Proofs of Storage from Homomorphic Identification Protocols
Proofs of storage (PoS) are interactive protocols allowing a client to verify that a server faithfully stores a file. Previous work has shown that proofs of storage can be constru...
Giuseppe Ateniese, Seny Kamara, Jonathan Katz
ASIACRYPT
2001
Springer
15 years 2 months ago
Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks
Abstract. Semantic security against chosen-ciphertext attacks (INDCCA) is widely believed as the correct security level for public-key encryption scheme. On the other hand, it is o...
Pierre-Alain Fouque, David Pointcheval