The following pages link to Benny Applebaum (Q301520):
Displaying 50 items.
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Garbling XOR gates ``for free'' in the standard model (Q315547) (← links)
- A dichotomy for local small-bias generators (Q315550) (← links)
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- Cryptography in constant parallel time (Q625101) (← links)
- Key-dependent message security: generic amplification and completeness (Q744344) (← links)
- On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\) (Q937192) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- Perfect secure computation in two rounds (Q1629404) (← links)
- On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate (Q1629415) (← links)
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations (Q1675751) (← links)
- From private simultaneous messages to zero-information Arthur-Merlin protocols and back (Q1698392) (← links)
- Minimizing locality of one-way functions via semi-private randomized encodings (Q1747656) (← links)
- Placing conditional disclosure of secrets in the communication complexity universe (Q2035998) (← links)
- Obfuscating circuits via composite-order graded encoding (Q2039401) (← links)
- The resiliency of MPC with low interaction: the benefit of making errors (extended abstract) (Q2119061) (← links)
- Upslices, downslices, and secret-sharing with complexity of \(1.5^n\) (Q2129013) (← links)
- On the relationship between statistical zero-knowledge and statistical randomized encodings (Q2281251) (← links)
- Secret-sharing schemes for general and uniform access structures (Q2292702) (← links)
- Degree 2 is complete for the round-complexity of malicious MPC (Q2292883) (← links)
- Locally computable UOWHF with linear shrinkage (Q2408584) (← links)
- Computationally private randomizing polynomials and their applications (Q2458940) (← links)
- On actively-secure elementary MPC reductions (Q2695655) (← links)
- Correction to: ``Locally computable UOWHF with linear shrinkage'' (Q2697675) (← 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)
- Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys (Q2849393) (← links)
- Public-key cryptography from different assumptions (Q2875143) (← links)
- A Dichotomy for Local Small-Bias Generators (Q2891508) (← links)
- Bootstrapping Obfuscators via Fast Pseudorandom Functions (Q2936606) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- Deterministic Rateless Codes for BSC (Q2989012) (← links)
- Arithmetic Cryptography (Q2989025) (← links)
- Randomly Encoding Functions: A New Cryptographic Paradigm (Q3002098) (← links)
- Key-Dependent Message Security: Generic Amplification and Completeness (Q3003401) (← links)
- Fast Pseudorandom Functions Based on Expander Graphs (Q3179351) (← links)
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems (Q3183587) (← links)
- From Secrecy to Soundness: Efficient Verification via Secure Computation (Q3587376) (← links)
- On Pseudorandom Generators with Linear Stretch in NC0 (Q3595413) (← links)
- Cryptography with Constant Input Locality (Q3612545) (← links)
- (Q4568110) (← links)
- Clique Here: On the Distributed Complexity in Fully-Connected Networks (Q4598914) (← links)
- Algebraic Attacks against Random Local Functions and Their Countermeasures (Q4600698) (← links)
- (Q4601848) (← links)
- (Q4638056) (← links)
- Arithmetic Cryptography (Q4640283) (← links)
- Garbling XOR Gates “For Free” in the Standard Model (Q4910277) (← links)
- Cryptographic Hardness of Random Local Functions–Survey (Q4910300) (← links)
- Locally Computable UOWHF with Linear Shrinkage (Q4924428) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
