scientific article
From MaRDI portal
Publication:3549593
zbMath1232.68044MaRDI QIDQ3549593
Yuval Ishai, Amit Sahai, Eyal Kushilevitz, Rafail Ostrovsky
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12)
Related Items (94)
Compilation of function representations for secure computing paradigms ⋮ SoK: how (not) to design and implement post-quantum cryptography ⋮ Verifiable Inner Product Encryption Scheme ⋮ Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography ⋮ Updateable Inner Product Argument with Logarithmic Verifier and Applications ⋮ Three-round secure multiparty computation from black-box two-round oblivious transfer ⋮ On the round complexity of black-box secure MPC ⋮ Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC ⋮ Round-optimal fully black-box zero-knowledge arguments from one-way permutations ⋮ Round optimal black-box ``commit-and-prove ⋮ Towards a unified approach to black-box constructions of zero-knowledge proofs ⋮ MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications ⋮ Efficient Secure Multiparty Computation with Identifiable Abort ⋮ BooLigero: improved sublinear zero knowledge proofs for Boolean circuits ⋮ Post-quantum key-blinding for authentication in anonymity networks ⋮ MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) ⋮ A simple post-quantum non-interactive zero-knowledge proof from garbled circuits ⋮ Secret Sharing Schemes with Algebraic Properties and Applications ⋮ Layering quantum-resistance into classical digital signature algorithms ⋮ ZK-PCPs from leakage-resilient secret sharing ⋮ Round-optimal black-box protocol compilers ⋮ Asymptotically quasi-optimal cryptography ⋮ Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier ⋮ Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions ⋮ Algebraic geometric secret sharing schemes over large fields are asymptotically threshold ⋮ From FE combiners to secure MPC and back ⋮ On \(d\)-multiplicative secret sharing ⋮ PrORAM ⋮ On interactive oracle proofs for Boolean R1CS statements ⋮ Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems ⋮ Black-box reusable NISC with random oracles ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Sok: vector OLE-based zero-knowledge protocols ⋮ Oblivious sampling with applications to two-party \(k\)-means clustering ⋮ Credibility in private set membership ⋮ Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract) ⋮ From Farfalle to \textsc{Megafono} via Ciminion: the PRF \textsc{Hydra} for MPC applications ⋮ Short signatures from regular syndrome decoding in the head ⋮ The return of the SDitH ⋮ Syndrome decoding in the head: shorter signatures from zero-knowledge proofs ⋮ Efficient NIZKs and signatures from commit-and-open protocols in the QROM ⋮ Verifiable decryption in the head ⋮ Resumable zero-knowledge for circuits from symmetric key primitives ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) ⋮ Four-round black-box non-malleable schemes from one-way permutations ⋮ Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head ⋮ On sufficient oracles for secure computation with identifiable abort ⋮ Black-box anonymous commit-and-prove ⋮ Efficient proof of RAM programs from any public-coin zero-knowledge system ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ MinRank in the head. Short signatures from zero-knowledge proofs ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ Lattice-based inner product argument ⋮ Quadratic multiparty randomized encodings beyond honest majority and their applications ⋮ On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives ⋮ Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II ⋮ GUC-secure commitments via random oracles: new impossibility and feasibility ⋮ Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic ⋮ How to recover a secret with \(O(n)\) additions ⋮ Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head ⋮ Code-based signatures from new proofs of knowledge for the syndrome decoding problem ⋮ Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature ⋮ A note on ramp secret sharing schemes from error-correcting codes ⋮ An Algebraic Approach to Nonmalleability ⋮ Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ On the Computational Overhead of MPC with Dishonest Majority ⋮ Sublinear Zero-Knowledge Arguments for RAM Programs ⋮ OT-Combiners via Secure Computation ⋮ From fairness to full security in multiparty computation ⋮ On the Complexity of Additively Homomorphic UC Commitments ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves ⋮ On the power of secure two-party computation ⋮ Security of hedged Fiat-Shamir signatures under fault attacks ⋮ Sigma protocols for MQ, PKP and SIS, and fishy signature schemes ⋮ Stacked garbling for disjunctive zero-knowledge proofs ⋮ Statistical ZAPR arguments from bilinear maps ⋮ Order-C secure multiparty computation for highly repetitive circuits ⋮ The more the merrier: reducing the cost of large scale MPC ⋮ Banquet: short and fast signatures from AES ⋮ On publicly-accountable zero-knowledge and small shuffle arguments ⋮ On the Power of Secure Two-Party Computation ⋮ Secure Protocol Transformations ⋮ Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems ⋮ Constant-Round Interactive Proofs for Delegating Computation ⋮ Black-box transformations from passive to covert security with public verifiability ⋮ Spartan: efficient and general-purpose zkSNARKs without trusted setup ⋮ On Secret Sharing with Nonlinear Product Reconstruction ⋮ TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures ⋮ Differential power analysis of the Picnic signature scheme ⋮ Zero-knowledge proofs for committed symmetric Boolean functions ⋮ The price of active security in cryptographic protocols
This page was built for publication:
