Pages that link to "Item:Q421036"
From MaRDI portal
The following pages link to Smooth projective hashing and two-message oblivious transfer (Q421036):
Displaying 37 items.
- Two-round adaptively secure multiparty computation from standard assumptions (Q1629408) (← links)
- Two-message statistically sender-private OT from LWE (Q1631337) (← links)
- An improved affine equivalence algorithm for random permutations (Q1648807) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Statistical ZAPR arguments from bilinear maps (Q2055670) (← links)
- Statistical ZAP arguments (Q2055672) (← links)
- Statistical Zaps and new oblivious transfer protocols (Q2055674) (← links)
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions (Q2056693) (← links)
- BETA: biometric-enabled threshold authentication (Q2061958) (← links)
- A gapless code-based hash proof system based on RQC and its applications (Q2099170) (← links)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- Succinct non-interactive secure computation (Q2119013) (← 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)
- On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
- Public key encryption with equality test via hash proof system (Q2330090) (← links)
- Strong authenticated key exchange with auxiliary inputs (Q2402976) (← links)
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers (Q2692389) (← links)
- Cryptographic group actions and applications (Q2692390) (← links)
- Amortizing rate-1 OT and applications to PIR and PSI (Q2697889) (← links)
- One-Round Strong Oblivious Signature-Based Envelope (Q2817800) (← links)
- What Security Can We Achieve Within 4 Rounds? (Q2827735) (← links)
- On the Existence of Extractable One-Way Functions (Q2829449) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- Cryptographic Reverse Firewall via Malleable Smooth Projective Hash Functions (Q2958150) (← links)
- 3-Message Zero Knowledge Against Human Ignorance (Q3179352) (← links)
- A New General Framework for Secure Public Key Encryption with Keyword Search (Q3194589) (← links)
- Revisited Experimental Comparison of Node-Link and Matrix Representations (Q4625118) (← links)
- Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS (Q4916002) (← links)
- Cryptography Using Captcha Puzzles (Q4916003) (← links)
- Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
- Circuit-Private Multi-key FHE (Q5738758) (← links)
- Algebraic restriction codes and their applications (Q6066762) (← links)
- A gapless post-quantum hash proof system in the Hamming metric (Q6535099) (← links)
- Weak zero-knowledge via the Goldreich-Levin theorem (Q6562563) (← links)
- The price of active security in cryptographic protocols (Q6595846) (← links)
- Lossy cryptography from code-based assumptions (Q6652889) (← links)
