Pages that link to "Item:Q5311543"
From MaRDI portal
The following pages link to Advances in Cryptology – CRYPTO 2004 (Q5311543):
Displaying 50 items.
- A note on constant-round zero-knowledge proofs of knowledge (Q380963) (← links)
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- Quantum state secure transmission in network communications (Q726483) (← links)
- Constant-round adaptive zero-knowledge proofs for NP (Q903613) (← links)
- Non-interactive and non-malleable commitment scheme based on \(q\)-one way group homomorphisms (Q999185) (← links)
- Parallel coin-tossing and constant-round secure two-party computation (Q1402368) (← links)
- Perfect secure computation in two rounds (Q1629404) (← links)
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- Pattern matching on encrypted streams (Q1633445) (← links)
- On secure two-party computation in three rounds (Q1690210) (← links)
- Round-optimal secure two-party computation from trapdoor permutations (Q1690212) (← links)
- Non-interactive secure computation from one-way functions (Q1710666) (← links)
- Computing boundary cycle of a pseudo-triangle polygon from its visibility graph (Q1997264) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Delayed-input cryptographic protocols (Q2011641) (← links)
- Towards accountability in CRS generation (Q2056795) (← links)
- Stacked garbling. Garbled circuit proportional to longest execution path (Q2096548) (← links)
- Better concrete security for half-gates garbling (in the multi-instance setting) (Q2096549) (← links)
- Efficient two-party exponentiation from quotient transfer (Q2096636) (← links)
- Succinct non-interactive secure computation (Q2119013) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- Round-optimal and communication-efficient multiparty computation (Q2169992) (← links)
- Round-optimal multi-party computation with identifiable abort (Q2170005) (← links)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← 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)
- Rate-1 quantum fully homomorphic encryption (Q2695630) (← links)
- Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
- Oblivious transfer from trapdoor permutations in minimal rounds (Q2697874) (← links)
- Improved OR-Composition of Sigma-Protocols (Q2799092) (← links)
- On Adaptively Secure Multiparty Computation with a Short CRS (Q2827714) (← 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)
- Spooky Encryption and Its Applications (Q2829944) (← links)
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds (Q2829950) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits (Q2947522) (← links)
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364) (← links)
- More Efficient Constant-Round Multi-party Computation from BMR and SHE (Q3179370) (← links)
- Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries (Q3600327) (← links)
- Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption (Q4915998) (← links)
- Round Efficient Unconditionally Secure Multiparty Computation Protocol (Q5504622) (← links)
- On the Exact Round Complexity of Self-composable Two-Party Computation (Q5738974) (← links)
- The Exact Round Complexity of Secure Computation (Q5739211) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- \(k\)-critical graphs in \(P_5\)-free graphs (Q5918256) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
- On perfectly secure 2PC in the OT-hybrid model (Q5919118) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
