2020
DOI: 10.1007/978-3-030-56784-2_11
|View full text |Cite
|
Sign up to set email alerts
|

Anonymous Tokens with Private Metadata Bit

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(21 citation statements)
references
References 31 publications
0
4
0
Order By: Relevance
“…The generator can add further metadata to add more transparency to privacy protection applications and guide the service provider about the received data (e.g., the type of data modification). We can set different access control settings as 'metadata' for every token entry, thus defining a set of requirements that must be met for access to be granted (e.g., for multi-users/shared environments) [57]. At the cloud side, a combined input of data and the input validity received, where inauthentic or invalid inputs may be prevented from being sent at the edge device.…”
Section: Stage 4: Streaming Vector Generationmentioning
confidence: 99%
“…The generator can add further metadata to add more transparency to privacy protection applications and guide the service provider about the received data (e.g., the type of data modification). We can set different access control settings as 'metadata' for every token entry, thus defining a set of requirements that must be met for access to be granted (e.g., for multi-users/shared environments) [57]. At the cloud side, a combined input of data and the input validity received, where inauthentic or invalid inputs may be prevented from being sent at the edge device.…”
Section: Stage 4: Streaming Vector Generationmentioning
confidence: 99%
“…19 In their protocol, users computed their full private keys (user-based key generation) and prepared data for the Using a verifiable oblivious pseudorandom function. 41,42 Security. Efficiency.…”
Section: Related Workmentioning
confidence: 99%
“…Specifically, we require that the PPOPRF scheme produces outputs of the form RO(x, τ, f (msk, x, τ)). Fortunately, many well-known OPRF primitives adhere to this requirement [17,28,33,38], including the scheme detailed in Section 5.…”
Section: Securitymentioning
confidence: 99%
“…The correctness of a ppoprf scheme primarily relates to OPRF-specific algorithms of (req, eval, finalize, blindeval), and showing that unblinded evaluation is consistent with blinded evaluation. This correctness condition originates from prior works that provide prior constructions of similar OPRFs [2,10,17,27,28,33,38]. The only change we make is to specify that correctness should only hold on unpunctured metadata tags.…”
Section: B1 Requirementsmentioning
confidence: 99%