Advances in Cryptology – CRYPTO 2004
From MaRDI portal
Publication:5311543
DOI10.1007/b99099zbMath1104.94027OpenAlexW2477011922WikidataQ27980744 ScholiaQ27980744MaRDI QIDQ5311543
Rafail Ostrovsky, Jonathan N. Katz
Publication date: 23 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99099
Related Items (49)
On the round complexity of black-box secure MPC ⋮ Round optimal black-box ``commit-and-prove ⋮ Pattern matching on encrypted streams ⋮ Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ More Efficient Constant-Round Multi-party Computation from BMR and SHE ⋮ Round-optimal and communication-efficient multiparty computation ⋮ Round-optimal multi-party computation with identifiable abort ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ A note on constant-round zero-knowledge proofs of knowledge ⋮ On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits ⋮ Bounded Collusion ABE for TMs from IBE ⋮ Maliciously-secure MrNISC in the plain model ⋮ Statistical security in two-party computation revisited ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ Constant-round adaptive zero-knowledge proofs for NP ⋮ Best of both worlds. Revisiting the spymasters double agent problem ⋮ Round-optimal black-box MPC in the plain model ⋮ Reusable secure computation in the plain model ⋮ List oblivious transfer and applications to round-optimal black-box multiparty coin tossing ⋮ Rate-1 quantum fully homomorphic encryption ⋮ Two-round maliciously secure computation with super-polynomial simulation ⋮ Oblivious transfer from trapdoor permutations in minimal rounds ⋮ Non-interactive secure computation from one-way functions ⋮ Efficient one-sided adaptively secure computation ⋮ Computing boundary cycle of a pseudo-triangle polygon from its visibility graph ⋮ Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ What security can we achieve within 4 rounds? ⋮ Delayed-input cryptographic protocols ⋮ Quantum state secure transmission in network communications ⋮ On the exact round complexity of secure three-party computation ⋮ Improved OR-Composition of Sigma-Protocols ⋮ Non-interactive and non-malleable commitment scheme based on \(q\)-one way group homomorphisms ⋮ \(k\)-critical graphs in \(P_5\)-free graphs ⋮ On the power of secure two-party computation ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Towards accountability in CRS generation ⋮ On Adaptively Secure Multiparty Computation with a Short CRS ⋮ The Feasibility of Outsourced Database Search in the Plain Model ⋮ What Security Can We Achieve Within 4 Rounds? ⋮ On the Power of Secure Two-Party Computation ⋮ Spooky Encryption and Its Applications ⋮ Concurrent Non-Malleable Commitments (and More) in 3 Rounds ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ On black-box complexity of universally composable security in the CRS model ⋮ Stacked garbling. Garbled circuit proportional to longest execution path ⋮ Better concrete security for half-gates garbling (in the multi-instance setting) ⋮ Succinct non-interactive secure computation
This page was built for publication: Advances in Cryptology – CRYPTO 2004
