Homomorphic Signature Schemes

By Rob Johnson, David A. Molnar, Dawn Song, David A. Wagner. The Cryptographer's Track at RSA Conference, 2002

527 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Cooperative Security for Network Coding File Distribution (2006, background): “Khron et al. [31] was the ﬁrst to provide a mechanism that allows for intermediate nodes to check erasure codes on-the-ﬂy using homomorphic hashing functions [4], [5], [7], [13], [28], [37], [40].”
Signing a Linear Subspace: Signature Schemes for Network Coding (2009, methodology): “Charles et al. [7] present a homomorphic signature scheme [19] based on the aggregate signature scheme of Boneh et al. [4].”
Homomorphic Signatures for Polynomial Functions (2011, background): “We also mention another line of related work that studies “redactable” signatures [35, 22,21,4,29,28,10,9,8,1,31].”
On-the-fly verification of rateless erasure codes for efficient content distribution (2004, background): “More recent work has investigated homomorphic signature schemes for specific applications: undirected transitive signatures [40], authenticated prefix aggregation [41], redactable signatures [ 42 ], and set-union signatures via accumulators [42].”
A Survey of Verifiable Computation (2017, background): “Moreover, homomorphic authentication was proposed and researched in [8, 50, 77, 85, 86], which can improve verifiable computation to be a homomorphic certified version.”