Witness Indistinguishability for Any Single-Round Argument with Applications to Access Control

public key cryptography, pp. 97-123, 2020.

Cited by: 0|Bibtex|Views9|DOI:https://doi.org/10.1007/978-3-030-45388-6_4
Other Links: academic.microsoft.com

Abstract:

Consider an access policy for some resource which only allows access to users of the system who own a certain set of attributes. Specifically, we consider the case where such an access structure is defined by some monotone function \\(f:\\{0,1\\}^N\\rightarrow \\{0,1\\}\\), belonging to some class of function \\(F\\) (e.g. conjunctions, s...More

Code:

Data:

Your rating :
0

 

Tags
Comments