2017
DOI: 10.1007/978-3-319-67816-0_13
|View full text |Cite
|
Sign up to set email alerts
|

Inonymous: Anonymous Invitation-Based System

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 4 publications
0
2
0
Order By: Relevance
“…Other research considers the use of cryptography for collaborating on graphbased data between two parties with privacy protections. However such works consider problems other than link prediction: merging and query performed on knowledge graphs owned by different parties [6]; whether one graph is a subgraph of the other graph [23]; single-source shortest distance and all-pairs shortest distance both in sparse and dense graphs [1]; all pairs shortest distance and single source shortest distance [4]; and transitive closure [14]; anonymous invitationbased system [2] and its extension to malicious adversarial model [3]. While it may be possible to transform some of these into finding common neighbours with a black-box approach, we provide a purpose-built protocol for common neighbour.…”
Section: Related Workmentioning
confidence: 99%
“…Other research considers the use of cryptography for collaborating on graphbased data between two parties with privacy protections. However such works consider problems other than link prediction: merging and query performed on knowledge graphs owned by different parties [6]; whether one graph is a subgraph of the other graph [23]; single-source shortest distance and all-pairs shortest distance both in sparse and dense graphs [1]; all pairs shortest distance and single source shortest distance [4]; and transitive closure [14]; anonymous invitationbased system [2] and its extension to malicious adversarial model [3]. While it may be possible to transform some of these into finding common neighbours with a black-box approach, we provide a purpose-built protocol for common neighbour.…”
Section: Related Workmentioning
confidence: 99%
“…[37] provided a quantitative point of reference for the difficulty of remembering random passwords, which is necessary to employ traditional solutions securely. Two-Factor Authentication (2FA): These schemes generally employ any combination of two of what you know (e.g., password), what you have (e.g., token), who you are (e.g., biometric), and who you know (see [12,34]). 2FA aims to strengthen the security of traditional password authentication by deploying a secondary authentication token (e.g., SMS sent to mobile device).…”
Section: Related Workmentioning
confidence: 99%