The following pages link to On arithmetic branching programs (Q1961372):
Displaying 7 items.
- Arithmetic circuits: the chasm at depth four gets wider (Q442109) (← links)
- Key-dependent message security: generic amplification and completeness (Q744344) (← links)
- On approximation by \(^{\oplus}\)-OBDDs (Q845954) (← links)
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks (Q1631346) (← links)
- From private simultaneous messages to zero-information Arthur-Merlin protocols and back (Q1698392) (← links)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
- On Linear Secret Sharing for Connectivity in Directed Graphs (Q3540044) (← links)
