2015 13th Annual Conference on Privacy, Security and Trust (PST) 2015
DOI: 10.1109/pst.2015.7232962
|View full text |Cite
|
Sign up to set email alerts
|

An efficient ID-based message recoverable privacy-preserving auditing scheme

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 22 publications
0
3
0
Order By: Relevance
“…''Millionaires' problem'' is a typical example for SMPC problem: two parties are interested to learn who is richer without revealing any information about their wealth. Secret Sharing scheme is a fundamental building block of many cryptographic protocols including securemulti-party computation of general functions (Kiraz 2008).…”
Section: Privacy Preserving Protocols Based Secure Multi-party Computmentioning
confidence: 99%
See 2 more Smart Citations
“…''Millionaires' problem'' is a typical example for SMPC problem: two parties are interested to learn who is richer without revealing any information about their wealth. Secret Sharing scheme is a fundamental building block of many cryptographic protocols including securemulti-party computation of general functions (Kiraz 2008).…”
Section: Privacy Preserving Protocols Based Secure Multi-party Computmentioning
confidence: 99%
“…Andrew Yao presented a solution to this problem in his seminal work, which is known as Yao's garbled circuit (Yao 1986;Kiraz 2008): Any arbitrary computation f(x, y) can be represented with primitive logical gates. One of the parties, say Bob, does the following for circuit creation.…”
Section: Privacy Preserving Protocols Based Secure Multi-party Computmentioning
confidence: 99%
See 1 more Smart Citation