Towards a classification of non-interactive computational assumptions in cyclic groups
- Submitting institution
-
University of the West of England, Bristol
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1166444
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-319-70697-9_3
- Title of conference / published proceedings
- Advances in Cryptology – ASIACRYPT 2017
- First page
- 66
- Volume
- 10625
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- November
- Year of publication
- 2017
- URL
-
https://doi.org/10.1007/978-3-319-70697-9_3
- 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
-
1
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The paper provides a classification of a large class of computational intractability assumptions underpinning a majority of existing cryptographic schemes. The framework is beneficial to both cryptanalysts and protocol designers. For the former, it specifies what assumptions they should target, whereas for the latter it can aid the choice of assumptions and be used as a guide to minimise the overall attack surface that different assumptions expose. Our results also include proving for the first time (in)equivalence among some widely used intractability assumptions.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
