Leveled Fully Homomorphic Signatures from Standard Lattices
In a homomorphic signature scheme, a user Alice signs some large dataset x using her secret signing key and uploads the signed data to an untrusted remote server. The server can then run some computation y=f(x) over the signed data and homomorphically derive a short signature σ[subscript f,y] certif...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Association for Computing Machinery,
2017-12-29T15:09:12Z.
|
| Subjects: | |
| Online Access: | Get fulltext |