2015 International Telecommunication Networks and Applications Conference (ITNAC) 2015
DOI: 10.1109/atnac.2015.7366787
|View full text |Cite
|
Sign up to set email alerts
|

Enabling efficient publicly verifiable outsourcing computation for matrix multiplication

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…In the protocol, clients jointly generate the key to PRF. We can refer to more PRF-based works for different application domains, such as [67], [68] for linear algebra, [69] for pattern matching, and [70] for data search. Moreover, oblivious PRF has also attracted the attention of researchers.…”
Section: B Pseudorandom Functionsmentioning
confidence: 99%
“…In the protocol, clients jointly generate the key to PRF. We can refer to more PRF-based works for different application domains, such as [67], [68] for linear algebra, [69] for pattern matching, and [70] for data search. Moreover, oblivious PRF has also attracted the attention of researchers.…”
Section: B Pseudorandom Functionsmentioning
confidence: 99%
“…Kumar et al [13] evaluated their algorithm on security, efficiency, and variability parameters. With high efficiency and practical usability, their algorithm can mostly replace costly cryptographic operations and securely solve matrix multiplication algorithm.…”
Section: Related Workmentioning
confidence: 99%