Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations

DOI10.1007/10958513_12zbMATH Open1255.94063OpenAlexW1515874337MaRDI QIDQ3404401FDOQ3404401

Authors: Anderson Nascimento, Joern Mueller-Quade, Akira Otsuka, Goichiro Hanaoka, Hideki Imai 

Publication date: 9 February 2010

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

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

Recommendations

• scientific article; zbMATH DE number 1982619
• An Efficient Framework for Unconditionally Secure Multiparty Computation
• Universally composable two-party and multi-party secure computation
• Scalable and Unconditionally Secure Multiparty Computation
• Theory of Cryptography
• Bounded-concurrent secure two-party computation without setup assumptions
• Efficient Two-Party Secure Computation on Committed Inputs
• Universally verifiable multiparty computation from threshold homomorphic cryptosystems
• Constructions and bounds for unconditionally secure non-interactive commitment schemes
• Secure two-party computation over unreliable channels

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Cited In (5)

• Constant-overhead secure computation of Boolean circuits using preprocessing
• Information Security and Cryptology - ICISC 2005
• Title not available (Why is that?)
• Title not available (Why is that?)
• Commodity-based 2PC for arithmetic circuits

This page was built for publication: Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3404401)