Homomorphic Signatures with Efficient Verification for Polynomial Functions
- Submitting institution
-
University of Bristol
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 94981496
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-662-44371-2_21
- Title of conference / published proceedings
- Advances in Cryptology - CRYPTO 2014
- First page
- 371
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- August
- Year of publication
- 2014
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
B - Cybersecurity and Cryptography
- Citation count
- 45
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Homomorphic signatures are a key enabling technology for verified outsourced computation. This paper is the first to construct such signatures for any function which can be expressed as a multivariate polynomial. It offers the most efficient standard model scheme which allows computing arbitrary polynomial functions (Homomorphic signatures schemes: A survey, ISBN 978-3-319-32115-8). The paper kickstarted a collaboration between the Universities of Bristol, Catania and Porto in the area of verifiable computation. This collaboration has attracted a British Council international exchanges grant (IE160351) and resulted in multiple strong research contributions (Euro Security and Privacy 16, Financial Crypto 17, RSA’19).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -