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

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, space bounded computation), where N is the number of possible attributes.

[1]  Rafail Ostrovsky,et al.  Trapdoor Hash Functions and Their Applications , 2019, IACR Cryptol. ePrint Arch..

[2]  Craig Gentry,et al.  i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits , 2010, IACR Cryptol. ePrint Arch..

[3]  Yael Tauman Kalai,et al.  Distinguisher-Dependent Simulation in Two Rounds and its Applications , 2017, CRYPTO.

[4]  Yael Tauman Kalai,et al.  Non-Interactive Delegation for Low-Space Non-Deterministic Computation , 2017, Electron. Colloquium Comput. Complex..

[5]  Yael Tauman Kalai,et al.  Delegating RAM Computations , 2016, TCC.

[6]  Yael Tauman Kalai,et al.  Statistical Witness Indistinguishability (and more) in Two Messages , 2018, IACR Cryptol. ePrint Arch..

[7]  David Chaum,et al.  Blind Signatures for Untraceable Payments , 1982, CRYPTO.

[8]  David Chaum,et al.  Security without identification: transaction systems to make big brother obsolete , 1985, CACM.

[9]  Yael Tauman Kalai,et al.  3-Message Zero Knowledge Against Human Ignorance , 2016, TCC.

[10]  Omer Paneth,et al.  On Publicly Verifiable Delegation From Standard Assumptions , 2018, IACR Cryptol. ePrint Arch..

[11]  Anat Paskin-Cherniavsky,et al.  Maliciously Circuit-Private FHE , 2014, CRYPTO.

[12]  Moni Naor,et al.  Bit Commitment Using Pseudo-Randomness , 1989, CRYPTO.

[13]  Ivan Damgård,et al.  Secure Two-Party Computation with Low Communication , 2012, IACR Cryptol. ePrint Arch..

[14]  Yael Tauman Kalai.  Smooth Projective Hashing and Two-Message Oblivious Transfer , 2005, EUROCRYPT.

[15]  R. Raz,et al.  How to delegate computations: the power of no-signaling proofs , 2014, Electron. Colloquium Comput. Complex..

[16]  Ron Rothblum,et al.  Constant-round interactive proofs for delegating computation , 2016, Electron. Colloquium Comput. Complex..

[17]  Andrew Chi-Chih Yao,et al.  Protocols for Secure Computations (Extended Abstract) , 1982, FOCS.

[18]  Zvika Brakerski,et al.  Two-Message Statistical Sender-Private OT from LWE , 2018, IACR Cryptol. ePrint Arch..

[19]  Moni Naor,et al.  Efficient oblivious transfer protocols , 2001, SODA '01.

[20]  Yael Tauman Kalai,et al.  Succinct delegation for low-space non-deterministic computation , 2018, STOC.

[21]  Yael Tauman Kalai,et al.  Non-interactive delegation and batch NP verification from standard computational assumptions , 2017, STOC.

[22]  Yael Tauman Kalai,et al.  Smooth Projective Hashing and Two-Message Oblivious Transfer , 2005, Journal of Cryptology.

[23]  Nir Bitansky,et al.  Recursive composition and bootstrapping for SNARKS and proof-carrying data , 2013, STOC '13.

[24]  Yael Tauman Kalai,et al.  Delegating computation: interactive proofs for muggles , 2008, STOC.