Homomorphic Signatures for Polynomial Functions

By Dan Boneh, David Mandell Freeman. International Conference on the Theory and Application of Cryptographic Techniques, 2011

305 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Geometry and Topology, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/6655c0fd22a7987c05b1d6964c3f9e119f08b97f

How researchers see this paper

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

In Artificial Intelligence

In Geometry and Topology

In Statistics and Probability

Citations in the corpus

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.”
Practical verified computation with streaming interactive proofs (2011, unknown): “[15, 19, 51]).”
Verifying computations with state (2013, background): “2522733 the remote hardware and use attestation [60, 63], but what if the hardware is faulty? The client could use a tailored solution [8, 13, 18, 28, 39, 58, 70, 73, 75], but such solutions are not available for all applications.”
Discrete Gaussian Leftover Hash Lemma over Infinite Domains (2013, background): “More recently, Boneh and Freeman [3] observed that under certain conditions, a linear combination of discrete Gaussians over a lattice is also a discrete Gaussian.”
Taking Proof-Based Verified Computation a Few Steps Closer to Practicality (2012, background): “Of course, addition and multiplication in Z/p do not “know” when their operands are negative.”
Functional Signatures and Pseudorandom Functions (2014, background): “For homomorphic signature schemes with public veriﬁcation, the most general construction of Boneh and Freeman [BF11] only allows the evaluation of multivariate polynomials on signed data.”
Oruta: Privacy- Preserving Public Auditing for Shared Data in the Cloud (2018, background): “Other cryptographic techniques related to homomor-phic authenticable signatures includes aggregate sig-natures [5], homomorphic signatures [10] and batch-verification signatures [11].”
Time-Optimal Interactive Proofs for Circuit Evaluation (2013, background): “A substantial body of work in this area has focused on the development of protocols targeted at specific problems (e.g. [2, 5, 16]).”