The following pages link to Carmit Hazay (Q244215):
Displaying 50 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- Automata evaluation and text search protocols with simulation-based security (Q290379) (← links)
- Signature schemes secure against hard-to-invert leakage (Q290397) (← links)
- Leakage-resilient cryptography from minimal assumptions (Q315546) (← links)
- Toward a game theoretic view of secure computation (Q321318) (← links)
- Efficient set operations in the presence of malicious adversaries (Q434343) (← links)
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- Computationally secure pattern matching in the presence of malicious adversaries (Q744607) (← links)
- Efficient secure two-party protocols. Techniques and constructions (Q983160) (← links)
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations (Q1629411) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q1690260) (← links)
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) (Q1710665) (← links)
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← links)
- Constant-round maliciously secure two-party computation in the RAM model (Q2010585) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? (Q2055669) (← links)
- Going beyond dual execution: MPC for functions with efficient verification (Q2055697) (← links)
- Generic compiler for publicly verifiable covert multi-party computation (Q2056768) (← links)
- Multi-clients verifiable computation via conditional disclosure of secrets (Q2106638) (← links)
- Gradual GRAM and secure computation for RAM programs (Q2106643) (← links)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- ZK-PCPs from leakage-resilient secret sharing (Q2159466) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
- Efficient RSA key generation and threshold Paillier in the two-party setting (Q2423838) (← links)
- On Black-Box Complexity of Universally Composable Security in the CRS Model (Q2795971) (← links)
- Adaptively Secure Computation with Partial Erasures (Q2796264) (← links)
- Selective Opening Security for Receivers (Q2811142) (← links)
- The Feasibility of Outsourced Database Search in the Plain Model (Q2827726) (← links)
- What Security Can We Achieve Within 4 Rounds? (Q2827735) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (Q2890015) (← links)
- Secure Two-Party Computation with Low Communication (Q2891476) (← links)
- Distributed public key schemes secure against continual leakage (Q2933792) (← links)
- On Compression of Data Encrypted With Block Ciphers (Q2989724) (← links)
- Towards a Game Theoretic View of Secure Computation (Q3003396) (← links)
- Computationally Secure Pattern Matching in the Presence of Malicious Adversaries (Q3058657) (← links)
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364) (← links)
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions (Q3179365) (← links)
- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model (Q3179369) (← links)
- Efficient Set Operations in the Presence of Malicious Adversaries (Q3562905) (← links)
- Text Search Protocols with Simulation Based Security (Q3562906) (← links)
- Approximate parameterized matching (Q3580940) (← links)
- Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions (Q3596389) (← links)
- Signature Schemes Secure against Hard-to-Invert Leakage (Q4911580) (← links)
- Leakage-Resilient Cryptography from Minimal Assumptions (Q4924409) (← links)
- Two-Dimensional Parameterized Matching (Q4962170) (← links)
- Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs (Q5261671) (← links)
- Outsourced Pattern Matching (Q5327464) (← links)
