Pages that link to "Item:Q5428116"
From MaRDI portal
The following pages link to Advances in Cryptology - CRYPTO 2003 (Q5428116):
Displaying 50 items.
- Automata evaluation and text search protocols with simulation-based security (Q290379) (← links)
- Fast cut-and-choose-based protocols for malicious and covert adversaries (Q290398) (← links)
- Garbling XOR gates ``for free'' in the standard model (Q315547) (← links)
- Computationally secure pattern matching in the presence of malicious adversaries (Q744607) (← links)
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- Information-theoretic broadcast with dishonest majority for long messages (Q1629421) (← links)
- Best possible information-theoretic MPC (Q1631330) (← links)
- Practical attacks against the walnut digital signature scheme (Q1633439) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost (Q1694723) (← links)
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free (Q1710663) (← links)
- All-but-many encryption (Q1747665) (← links)
- Efficient and secure outsourced approximate pattern matching protocol (Q1797787) (← links)
- Oblivious DFA evaluation on joint input and its applications (Q2023228) (← links)
- Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer (Q2023253) (← links)
- High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760) (← links)
- SPEED: secure, private, and efficient deep learning (Q2051270) (← links)
- Blazing fast OT for three-round UC OT extension (Q2055696) (← links)
- The rise of Paillier: homomorphic secret sharing and public-key silent OT (Q2056710) (← links)
- Oblivious transfer is in MiniQCrypt (Q2056751) (← links)
- VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE (Q2056777) (← links)
- Masked triples. Amortizing multiplication triples across conditionals (Q2061960) (← links)
- Private set operations from oblivious switching (Q2061976) (← links)
- Actively secure setup for SPDZ (Q2072211) (← links)
- Efficient constant-round MPC with identifiable abort and public verifiability (Q2096540) (← links)
- Black-box transformations from passive to covert security with public verifiability (Q2096543) (← links)
- Stacked garbling. Garbled circuit proportional to longest execution path (Q2096548) (← links)
- Improved primitives for MPC over mixed arithmetic-binary circuits (Q2096551) (← links)
- PSI-stats: private set intersection protocols supporting secure statistical functions (Q2096631) (← links)
- Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA (Q2096633) (← links)
- Efficient and tight oblivious transfer from PKE with tight multi-user security (Q2096634) (← links)
- Private set intersection in the internet setting from lightweight oblivious PRF (Q2102052) (← links)
- PSI from PaXoS: fast, malicious private set intersection (Q2119031) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- Oblivious key-value stores and amplification for private set intersection (Q2128570) (← links)
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes (Q2129008) (← links)
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications (Q2139646) (← links)
- Full-threshold actively-secure multiparty arithmetic circuit garbling (Q2146106) (← links)
- Round-optimal black-box protocol compilers (Q2170000) (← links)
- Batch-OT with optimal rate (Q2170043) (← links)
- Efficient and scalable universal circuits (Q2188968) (← links)
- Secure two-party computation in a quantum world (Q2229292) (← links)
- Efficient, actively secure MPC with a dishonest majority: a survey (Q2232208) (← links)
- Security against covert adversaries: Efficient protocols for realistic adversaries (Q2267365) (← links)
- More efficient oblivious transfer extensions (Q2408589) (← links)
- On the feasibility of extending oblivious transfer (Q2413614) (← links)
- Fast garbling of circuits under standard assumptions (Q2413616) (← links)
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
- Optimal extension protocols for Byzantine broadcast and agreement (Q2657277) (← links)
- Adaptively code-correlation robustness functions and its applications to private set intersection (Q2682918) (← links)
