Theory of Cryptography

DOI10.1007/11681878zbMath1112.94026OpenAlexW3149533473WikidataQ57254512 ScholiaQ57254512MaRDI QIDQ5898360

Matthias Fitzi, Jesper Buus Nielsen, Eike Kiltz, Ivan B. Damgård, Tomas Toft

Publication date: 12 February 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11681878

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (37)

Efficient secure multiparty computation of sparse vector dot products ⋮ Compilation of function representations for secure computing paradigms ⋮ Secure Computation, I/O-Efficient Algorithms and Distributed Signatures ⋮ Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC ⋮ Multiparty Proximity Testing with Dishonest Majority from Equality Testing ⋮ \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation ⋮ Efficient noise generation to achieve differential privacy with applications to secure multiparty computation ⋮ Secure Multi-party Shuffling ⋮ Private liquidity matching using MPC ⋮ Constant-round client-aided secure comparison protocol ⋮ Our Data, Ourselves: Privacy Via Distributed Noise Generation ⋮ Secure computation with preprocessing via function secret sharing ⋮ Graph coloring applied to secure computation in non-abelian groups ⋮ Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption ⋮ Secure two-party input-size reduction: challenges, solutions and applications ⋮ Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext ⋮ Amortizing division and exponentiation ⋮ Privacy preserving solution of DCOPs by mediation ⋮ \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s ⋮ Private evaluation of a decision tree based on secret sharing ⋮ Selected application of the Chinese remainder theorem in multiparty computation ⋮ Client-Aided Two-Party Secure Interval Test Protocol ⋮ An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks ⋮ A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals ⋮ Efficient Binary Conversion for Paillier Encrypted Values ⋮ Distributed Private Data Analysis: Simultaneously Solving How and What ⋮ Private Database Access with HE-over-ORAM Architecture ⋮ A note on secure multiparty computation via higher residue symbols ⋮ Efficient Secure Two-Party Exponentiation ⋮ Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values ⋮ Function secret sharing for mixed-mode and fixed-point secure computation ⋮ Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation ⋮ Generic Constant-Round Oblivious Sorting Algorithm for MPC ⋮ Two-server distributed ORAM with sublinear computation and constant rounds ⋮ Practically Efficient Secure Single-Commodity Multi-market Auctions ⋮ Improved primitives for MPC over mixed arithmetic-binary circuits ⋮ Efficient two-party exponentiation from quotient transfer

This page was built for publication: Theory of Cryptography