The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Privacy preserving auctions and mechanism design
Proceedings of the 1st ACM conference on Electronic commerce
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Efficient oblivious transfer protocols
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The Power of RSA Inversion Oracles and the Security of Chaum's RSA-Based Blind Signature Scheme
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
Private collaborative forecasting and benchmarking
Proceedings of the 2004 ACM workshop on Privacy in the electronic society
Foundations of Cryptography: Volume 1
Foundations of Cryptography: Volume 1
Transforming Semi-Honest Protocols to Ensure Accountability
ICDMW '06 Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Fair secure two-party computation
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
On honesty in sovereign information sharing
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Design of a temporal geosocial semantic web for military stabilization and reconstruction operations
Proceedings of the ACM SIGKDD Workshop on CyberSecurity and Intelligence Informatics
Accurate and large-scale privacy-preserving data mining using the election paradigm
Data & Knowledge Engineering
Accountability: definition and relationship to verifiability
Proceedings of the 17th ACM conference on Computer and communications security
Privacy-preserving data mining: a game-theoretic approach
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
Anonymity meets game theory: secure data integration with malicious participants
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient two-party private blocking based on sorted nearest neighborhood clustering
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |
The secure multi-party computation (SMC) model provides means for balancing the use and confidentiality of distributed data. This is especially important in the field of privacy-preserving data mining (PPDM). Increasing security concerns have led to a surge in work on practical secure multi-party computation protocols. However, most are only proven secure under the semi-honest model, and security under this adversary model is insufficient for many PPDM applications. SMC protocols under the malicious adversary model generally have impractically high complexities for PPDM. We propose an accountable computing (AC) framework that enables liability for privacy compromise to be assigned to the responsible party without the complexity and cost of an SMC-protocol under the malicious model. We show how to transform a circuit-based semi-honest two-party protocol into a protocol satisfying the AC-framework. The transformations are simple and efficient. At the same time, the verification phase of the transformed protocol is capable of detecting any malicious behaviors that can be prevented under the malicious model.