The following pages link to Benny Pinkas (Q244225):
Displaying 50 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- Secure computation of functionalities based on Hamming distance and its application to computing document similarity (Q381129) (← links)
- A proof of security of Yao's protocol for two-party computation (Q1015361) (← links)
- Efficient circuit-based PSI via cuckoo hashing (Q1653080) (← links)
- Distributed SSH key management with proactive RSA threshold signatures (Q1656018) (← links)
- Committed MPC -- maliciously secure multiparty computation from homomorphic commitments (Q1749303) (← links)
- Computationally secure oblivious transfer (Q1777283) (← links)
- Fast distributed RSA key generation for semi-honest and malicious adversaries (Q1784098) (← links)
- Efficient scalable multiparty private set-intersection via garbled Bloom filters (Q1796793) (← links)
- Secure two-party computation via cut-and-choose oblivious transfer (Q1928765) (← links)
- PSI from PaXoS: fast, malicious private set intersection (Q2119031) (← links)
- Oblivious key-value stores and amplification for private set intersection (Q2128570) (← links)
- Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles (Q2272198) (← links)
- Efficient circuit-based PSI with linear communication (Q2292690) (← links)
- SpOT-light: lightweight private set intersection from sparse OT extension (Q2304926) (← links)
- Efficient constant-round multi-party computation combining BMR and SPDZ (Q2318094) (← links)
- An efficient protocol for secure two-party computation in the presence of malicious adversaries (Q2344051) (← links)
- Fast garbling of circuits under standard assumptions (Q2413616) (← links)
- (Q2707416) (← links)
- (Q2768332) (← links)
- Oblivious transfer and polynomial evaluation (Q2819551) (← links)
- Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer (Q3000547) (← links)
- Secure Set Intersection with Untrusted Hardware Tokens (Q3073691) (← links)
- The Design and Implementation of Protocol-Based Hidden Key Recovery (Q3404402) (← links)
- Efficient Constant Round Multi-party Computation Combining BMR and SPDZ (Q3457072) (← links)
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries (Q3540034) (← links)
- Privacy-Preserving Group Discovery with Linear Complexity (Q3575059) (← links)
- Oblivious RAM Revisited (Q3582774) (← links)
- Secure Two-Party Computation Is Practical (Q3650696) (← links)
- (Q4249354) (← links)
- (Q4249667) (← links)
- (Q4250771) (← links)
- On the Impossibility of Private Key Cryptography with Weakly Random Keys (Q4279593) (← links)
- (Q4364561) (← links)
- (Q4434870) (← links)
- (Q4536284) (← links)
- (Q4536793) (← links)
- Tracing traitors (Q4545764) (← links)
- (Q4738937) (← links)
- (Q4941880) (← links)
- Secure Computation on the Web: Computing without Simultaneous Interaction (Q5199188) (← links)
- The IPS Compiler: Optimizations, Variants and Concrete Efficiency (Q5199196) (← links)
- Advances in Cryptology - EUROCRYPT 2004 (Q5307243) (← links)
- Advances in Cryptology - EUROCRYPT 2004 (Q5307245) (← links)
- Non-Interactive Secure Computation Based on Cut-and-Choose (Q5418707) (← links)
- Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles (Q5426024) (← links)
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries (Q5429383) (← links)
- Oblivious Polynomial Evaluation (Q5470733) (← links)
- Theory of Cryptography (Q5711649) (← links)
- Asymptotically Tight Bounds for Composing ORAM with PIR (Q5738784) (← links)
