Options
Arithmetic cryptography
Publikationstyp
Journal Article
Date Issued
2017
Sprache
English
Author(s)
Institut
TORE-URI
Journal
Volume
64
Issue
2
Start Page
1
End Page
74
Article Number
10
Citation
Journal of the ACM 2 (64): 10 1-74 (2017)
Publisher DOI
Scopus ID
Publisher
ACM
We study the possibility of computing cryptographic primitives in a fully black-box arithmetic model over a finite field F. In this model, the input to a cryptographic primitive (e.g., encryption scheme) is given as a sequence of field elements, the honest parties are implemented by arithmetic circuits that make only a black-box use of the underlying field, and the adversary has a full (non-black-box) access to the field. This model captures many standard information-theoretic constructions. We prove several positive and negative results in this model for various cryptographic tasks. On the positive side, we show that, under coding-related intractability assumptions, computational primitives like commitment schemes, public-key encryption, oblivious transfer, and general secure two-party computation can be implemented in this model. On the negative side, we prove that garbled circuits, additively homomorphic encryption, and secure computation with low online complexity cannot be achieved in this model. Our results reveal a qualitative difference between the standard Boolean model and the arithmetic model, and explain, in retrospect, some of the limitations of previous constructions.
Subjects
arithmetic complexity
cryptography
learning with noise
secure computation
DDC Class
620: Ingenieurwissenschaften