The following pages link to (Q2778845):
Displaying 50 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- Smooth projective hashing and two-message oblivious transfer (Q421036) (← links)
- Communication-efficient distributed oblivious transfer (Q439979) (← links)
- Efficient oblivious transfers with access control (Q453798) (← links)
- Generalized oblivious transfer by secret sharing (Q629875) (← links)
- Restricted adaptive oblivious transfer (Q650878) (← links)
- Selling multiple secrets to a single buyer (Q833739) (← links)
- Solutions to the anti-piracy problem in oblivious transfer (Q899580) (← links)
- On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate (Q1629415) (← links)
- Two-message statistically sender-private OT from LWE (Q1631337) (← links)
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ (Q1633461) (← links)
- Optimal linear multiparty conditional disclosure of secrets protocols (Q1710680) (← links)
- Placing conditional disclosure of secrets in the communication complexity universe (Q2035998) (← links)
- Statistical Zaps and new oblivious transfer protocols (Q2055674) (← links)
- Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA (Q2096633) (← links)
- Two-round oblivious transfer from CDH or LPN (Q2119032) (← links)
- Three-round secure multiparty computation from black-box two-round oblivious transfer (Q2128560) (← links)
- Quadratic secret sharing and conditional disclosure of secrets (Q2129018) (← links)
- Somewhere statistically binding commitment schemes with applications (Q2145407) (← links)
- Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions (Q2149832) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
- Channels of small log-ratio leakage and characterization of two-party differentially private computation (Q2175926) (← links)
- UC priced oblivious transfer with purchase statistics and dynamic pricing (Q2179394) (← links)
- Secure two-party computation in a quantum world (Q2229292) (← links)
- Security against covert adversaries: Efficient protocols for realistic adversaries (Q2267365) (← links)
- An efficient protocol for secure two-party computation in the presence of malicious adversaries (Q2344051) (← links)
- On the feasibility of extending oblivious transfer (Q2413614) (← links)
- Individual simulations (Q2691606) (← links)
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers (Q2692389) (← links)
- Rate-1 quantum fully homomorphic encryption (Q2695630) (← links)
- Amortizing rate-1 OT and applications to PIR and PSI (Q2697889) (← links)
- Accelerating Oblivious Transfer with Batch Multi-exponentiation (Q2817471) (← links)
- On the Existence of Extractable One-Way Functions (Q2829449) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- Adaptive Oblivious Transfer and Generalization (Q2953778) (← links)
- Oblivious Keyword Search with Authorization (Q2953857) (← links)
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol (Q2968163) (← links)
- 3-Message Zero Knowledge Against Human Ignorance (Q3179352) (← links)
- Universally Composable Adaptive Priced Oblivious Transfer (Q3392915) (← links)
- Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens (Q3408203) (← links)
- Fully-Simulatable Oblivious Set Transfer (Q3511158) (← links)
- Improved Garbled Circuit: Free XOR Gates and Applications (Q3519525) (← links)
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries (Q3540034) (← links)
- New Communication-Efficient Oblivious Transfer Protocols Based on Pairings (Q3540161) (← links)
- Towards Robust Computation on Encrypted Data (Q3600376) (← links)
- Communication-Efficient Private Protocols for Longest Common Subsequence (Q3623051) (← links)
- Another Look at Extended Private Information Retrieval Protocols (Q3637147) (← links)
- Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS (Q4916002) (← links)
- Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
