The following pages link to Nir Bitansky (Q744604):
Displaying 50 items.
- On strong simulation and composable point obfuscation (Q744605) (← links)
- One-message zero knowledge and non-malleable commitments (Q1629409) (← links)
- Structure vs. hardness through the obfuscation lens (Q1675749) (← links)
- On virtual grey box obfuscation for general circuits (Q1688397) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Characterizing deterministic-prover zero knowledge (Q2055736) (← links)
- Weakly extractable one-way functions (Q2055739) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- A note on perfect correctness by derandomization (Q2146431) (← links)
- Non-malleable commitments against quantum attacks (Q2170101) (← links)
- From cryptomania to obfustopia through secret-key functional encryption (Q2175212) (← links)
- On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920) (← links)
- Distributional collision resistance beyond one-way functions (Q2292711) (← links)
- On round optimal statistical zero knowledge arguments (Q2304917) (← links)
- Post-quantum resettably-sound zero knowledge (Q2695624) (← links)
- Classical binding for quantum commitments (Q2695637) (← links)
- Indistinguishability Obfuscation: From Approximate to Exact (Q2796119) (← links)
- Perfect Structure on the Edge of Chaos (Q2796138) (← links)
- Time-Lock Puzzles from Randomized Encodings (Q2800583) (← links)
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again (Q2826067) (← links)
- On the Existence of Extractable One-Way Functions (Q2829449) (← links)
- The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator (Q2874531) (← links)
- On Virtual Grey Box Obfuscation for General Circuits (Q2874533) (← links)
- Leakage-Tolerant Computation with Input-Independent Preprocessing (Q2874535) (← links)
- Point Obfuscation and 3-Round Zero-Knowledge (Q2891483) (← links)
- Leakage-Tolerant Interactive Protocols (Q2891488) (← links)
- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits (Q2914264) (← links)
- Succinct Randomized Encodings and their Applications (Q2941536) (← links)
- Program Obfuscation with Leaky Hardware (Q3102218) (← links)
- 3-Message Zero Knowledge Against Human Ignorance (Q3179352) (← links)
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption (Q3181034) (← links)
- On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation (Q3449562) (← links)
- On Strong Simulation and Composable Point Obfuscation (Q3582775) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- Indistinguishability Obfuscation from Functional Encryption (Q4625660) (← links)
- Why “Fiat-Shamir for Proofs” Lacks a Proof (Q4910278) (← links)
- Succinct Non-interactive Arguments via Linear Interactive Proofs (Q4910285) (← links)
- Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
- Post-quantum zero knowledge in constant rounds (Q5144915) (← links)
- Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
- Weak zero-knowledge beyond the black-box barrier (Q5212849) (← links)
- Multi-collision resistance: a paradigm for keyless hash functions (Q5230329) (← links)
- On the existence of extractable one-way functions (Q5259586) (← links)
- ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation (Q5261685) (← links)
- A Note on Perfect Correctness by Derandomization (Q5267419) (← links)
- Recursive composition and bootstrapping for SNARKS and proof-carrying data (Q5495781) (← links)
- On the impossibility of approximate obfuscation and applications to resettable cryptography (Q5495794) (← links)
- On Removing Graded Encodings from Functional Encryption (Q5738968) (← links)
- Obfuscation for Evasive Functions (Q5746331) (← links)
- (Q5875699) (← links)
