Paper 2018/375
Witness Indistinguishability for any Single-Round Argument with Applications to Access Control
Zvika Brakerski and Yael Tauman Kalai
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
Note: Prior versions of this report contained an additional result about a new batch delegation scheme for monotone formulae (see ePrint history for this report). We removed that result from this work because we believe that it better fits into a different work.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A minor revision of an IACR publication in PKC 2020
- Keywords
- delegationwitness indistinguishabilityaccess control
- Contact author(s)
- zvika brakerski @ weizmann ac il
- History
- 2020-02-02: last of 2 revisions
- 2018-04-30: received
- See all versions
- Short URL
- https://ia.cr/2018/375
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/375, author = {Zvika Brakerski and Yael Tauman Kalai}, title = {Witness Indistinguishability for any Single-Round Argument with Applications to Access Control}, howpublished = {Cryptology {ePrint} Archive, Paper 2018/375}, year = {2018}, url = {https://eprint.iacr.org/2018/375} }