Cryptography miracles, secure auctions, matching problem verification

Authors:
Silvio Micali;Michael O. Rabin
Affiliations:
Massachusetts Institute of Technology, Cambridge, MA;Harvard University, Cambridge, MA
Venue:
Communications of the ACM
Year:
2014

The knowledge complexity of interactive proof systems

SIAM Journal on Computing
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Practical secrecy-preserving, verifiably correct and trustworthy auctions

ICEC '06 Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet
FairplayMP: a system for secure multi-party computation

Proceedings of the 15th ACM conference on Computer and communications security
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Strictly-black-box zero-knowledge and efficient validation of financial transactions

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I

Hi-index	48.22

A solution to the persistent problem of preventing collusion in Vickrey auctions.