Pages that link to "Item:Q2989020"

The following pages link to Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication (Q2989020):

Displaying 16 items.

• Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
• The augmentation property of binary matrices for the binary and Boolean rank (Q1668986) (← links)
• From private simultaneous messages to zero-information Arthur-Merlin protocols and back (Q1698392) (← links)
• Arthur-Merlin games in Boolean decision trees (Q1961380) (← links)
• An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity (Q1983326) (← links)
• Placing conditional disclosure of secrets in the communication complexity universe (Q2035998) (← links)
• On the relationship between statistical zero-knowledge and statistical randomized encodings (Q2281251) (← links)
• From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back (Q2799090) (← links)
• On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings (Q2829956) (← links)
• On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols (Q3611768) (← links)
• A Hierarchy Theorem for Interactive Proofs of Proximity (Q4638092) (← links)
• An Exponential Separation Between MA and AM Proofs of Proximity (Q5002752) (← links)
• (Q5090374) (← links)
• Lifting Theorems for Equality (Q5090501) (← links)
• On the Power of Statistical Zero Knowledge (Q5117376) (← links)
• Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations (Q5149756) (← links)