Theory of Cryptography
From MaRDI portal
Publication:5711651
DOI10.1007/b106171zbMath1079.94541OpenAlexW4251449056WikidataQ59379672 ScholiaQ59379672MaRDI QIDQ5711651
Yuval Ishai, Ronald Cramer, Ivan B. Damgård
Publication date: 7 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106171
Related Items (38)
Sashimi: Cutting up CSI-FiSh Secret Keys to Produce an Actively Secure Distributed Signing Protocol ⋮ Fluid MPC: secure multiparty computation with dynamic participants ⋮ FROST: Flexible round-optimized Schnorr threshold signatures ⋮ Best possible information-theoretic MPC ⋮ Exploring crypto dark matter: new simple PRF candidates and their applications ⋮ Binary AMD Circuits from Secure Multiparty Computation ⋮ Improving the efficiency of AES protocols in multi-party computation ⋮ Efficient noise generation to achieve differential privacy with applications to secure multiparty computation ⋮ Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms ⋮ Complexity and performance of secure floating-point polynomial evaluation protocols ⋮ Distributed (correlation) samplers: how to remove a trusted dealer in one round ⋮ CNF-FSS and Its Applications ⋮ On optimal cryptographic key derivation ⋮ High-throughput secure three-party computation with an honest majority ⋮ MPClan: protocol suite for privacy-conscious computations ⋮ Prio+: privacy preserving aggregate statistics via Boolean shares ⋮ Linear-time 2-party secure merge from additively homomorphic encryption ⋮ Efficient fully secure computation via distributed zero-knowledge proofs ⋮ Random-index PIR and applications ⋮ Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions ⋮ Simplified Submission of Inputs to Protocols ⋮ Improved building blocks for secure multi-party computation based on secret sharing with honest majority ⋮ A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals ⋮ Multi-party computation with conversion of secret sharing ⋮ Fast large-scale honest-majority MPC for malicious adversaries ⋮ Secure Outsourced Computation ⋮ General constructions for information-theoretic private information retrieval ⋮ OT-Combiners via Secure Computation ⋮ On the local leakage resilience of linear secret sharing schemes ⋮ Distributed key generation for SM9-based systems ⋮ Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings ⋮ Breaking the Circuit Size Barrier for Secure Computation Under DDH ⋮ Efficient, Robust and Constant-Round Distributed RSA Key Generation ⋮ Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems ⋮ Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation ⋮ MPC with friends and foes ⋮ Multiparty generation of an RSA modulus ⋮ Unnamed Item
This page was built for publication: Theory of Cryptography
