User menu

Practically efficient secure single-commodity multi-market auctions

Bibliographic reference Aly, Abdelrahaman ; Van Vyve, Mathieu. Practically efficient secure single-commodity multi-market auctions. In: J Grossklags and B. Preneel, Financial Criptography and Data Security, Springer  2017, p. 110-129
Permanent URL
  1. Klemperer, P.: What really matters in auction design, from auctions: theory and practice. In: Auctions: Theory and Practice. Introductory Chapters. Princeton University Press (2004)
  2. Yao, A.C.C.: Protocols for secure computations (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, pp. 160–164. IEEE (1982)
  3. Shoup, V.: NTL: a library for doing number theory.
  4. Bogetoft Peter, Christensen Dan Lund, Damgård Ivan, Geisler Martin, Jakobsen Thomas, Krøigaard Mikkel, Nielsen Janus Dam, Nielsen Jesper Buus, Nielsen Kurt, Pagter Jakob, Schwartzbach Michael, Toft Tomas, Secure Multiparty Computation Goes Live, Financial Cryptography and Data Security (2009) ISBN:9783642035487 p.325-343, 10.1007/978-3-642-03549-4_20
  5. Geisler, M.: Cryptographic protocols: theory and implementation. Ph.D. thesis, Aarhus University Denmark, Department of Computer Science (2010)
  6. Aly Abdelrahaman, Van Vyve Mathieu, Securely Solving Classical Network Flow Problems, Information Security and Cryptology - ICISC 2014 (2015) ISBN:9783319159423 p.205-221, 10.1007/978-3-319-15943-0_13
  7. Franklin M.K., Reiter M.K., The design and implementation of a secure auction service, 10.1109/32.502223
  8. Harkavy, M., Tygar, J.D., Kikuchi, H.: Electronic auctions with private bids. In: Proceedings of the 3rd Conference on USENIX Workshop on Electronic Commerce, WOEC 1998, vol. 3, p. 6. USENIX Association, Berkeley (1998)
  9. Kikuchi H., Hotta S., Abe K., Nakanishi S., Distributed auction servers resolving winner and winning bid without revealing privacy of bids, 10.1109/padsw.2000.884610
  10. Peng Kun, Boyd Colin, Dawson Ed, Optimization of Electronic First-Bid Sealed-Bid Auction Based on Homomorphic Secret Sharing, Progress in Cryptology – Mycrypt 2005 (2005) ISBN:9783540289388 p.84-98, 10.1007/11554868_7
  11. Nojoumian Mehrdad, Stinson Douglas R., Efficient Sealed-Bid Auction Protocols Using Verifiable Secret Sharing, Information Security Practice and Experience (2014) ISBN:9783319063195 p.302-317, 10.1007/978-3-319-06320-1_23
  12. Shamir Adi, How to share a secret, 10.1145/359168.359176
  13. Catane, B., Herzberg, A.: Secure second price auctions with a rational auctioneer. In: The 10-th SECRYPT International Conference on Security and Cryptography (2013)
  14. Madani, M., Van Vyve, M.: A new formulation of the European day-ahead electricity market problem and its algorithmic consequences. CORE Discussion Papers 2013074, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2013)
  15. Madani Mehdi, Van Vyve Mathieu, Computationally efficient MIP formulation and algorithms for European day-ahead electricity market auctions, 10.1016/j.ejor.2014.09.060
  16. Whitney Hassler, On the Abstract Properties of Linear Dependence, 10.2307/2371182
  17. Ben-Or Michael, Wigderson Avi, Completeness theorems for non-cryptographic fault-tolerant distributed computation, 10.1145/62212.62213
  18. Chor Benny, Goldwasser Shafi, Micali Silvio, Awerbuch Baruch, Verifiable secret sharing and achieving simultaneity in the presence of faults, 10.1109/sfcs.1985.64
  19. Gennaro Rosario, Rabin Michael O., Rabin Tal, Simplified VSS and fast-track multiparty computations with applications to threshold cryptography, 10.1145/277697.277716
  20. Beimel Amos, Secret-Sharing Schemes: A Survey, Lecture Notes in Computer Science (2011) ISBN:9783642209000 p.11-46, 10.1007/978-3-642-20901-7_2
  21. Damgård Ivan, Fitzi Matthias, Kiltz Eike, Nielsen Jesper Buus, Toft Tomas, Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation, Theory of Cryptography (2006) ISBN:9783540327318 p.285-304, 10.1007/11681878_15
  22. Nishide Takashi, Ohta Kazuo, Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol, Public Key Cryptography – PKC 2007 ISBN:9783540716761 p.343-360, 10.1007/978-3-540-71677-8_23
  23. Catrina Octavian, de Hoogh Sebastiaan, Improved Primitives for Secure Multiparty Integer Computation, Lecture Notes in Computer Science (2010) ISBN:9783642153167 p.182-199, 10.1007/978-3-642-15317-4_13
  24. Lipmaa Helger, Toft Tomas, Secure Equality and Greater-Than Tests with Sublinear Online Complexity, Automata, Languages, and Programming (2013) ISBN:9783642392115 p.645-656, 10.1007/978-3-642-39212-2_56
  25. Laur Sven, Willemson Jan, Zhang Bingsheng, Round-Efficient Oblivious Database Manipulation, Lecture Notes in Computer Science (2011) ISBN:9783642248603 p.262-277, 10.1007/978-3-642-24861-0_18
  26. Keller Marcel, Scholl Peter, Efficient, Oblivious Data Structures for MPC, Lecture Notes in Computer Science (2014) ISBN:9783662456071 p.506-525, 10.1007/978-3-662-45608-8_27
  27. Czumaj, A., Kanarek, P., Kutylowski, M., Lorys, K.: Delayed path coupling and generating random permutations via distributed stochastic processes. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1999, pp. 271–280. Society for Industrial and Applied Mathematics, Philadelphia (1999)
  28. Goodrich Michael T., Randomized Shellsort : A Simple Data-Oblivious Sorting Algorithm, 10.1145/2049697.2049701
  29. Jónsson, K.V., Kreitz, G., Uddin, M.: Secure multi-party sorting and applications. In: IACR Cryptology ePrint Archive, vol. 2011, p. 122 (2011)
  30. Goodrich Michael T., Zig-zag sort : a simple deterministic data-oblivious sorting algorithm running in O(n log n) time, 10.1145/2591796.2591830
  31. Hamada, K., Ikarashi, D., Chida, K., Takahashi, K.: Oblivious radix sort: an efficient sorting algorithm for practical secure multi-party computation. In: IACR Cryptology ePrint Archive, vol. 2014, p. 121 (2014)
  32. Aly Abdelrahaman, Cuvelier Edouard, Mawet Sophie, Pereira Olivier, Van Vyve Mathieu, Securely Solving Simple Combinatorial Graph Problems, Financial Cryptography and Data Security (2013) ISBN:9783642398834 p.239-257, 10.1007/978-3-642-39884-1_21
  33. Blanton Marina, Steele Aaron, Alisagari Mehrdad, Data-oblivious graph algorithms for secure computation and outsourcing, 10.1145/2484313.2484341
  34. Catrina Octavian, de Hoogh Sebastiaan, Secure Multiparty Linear Programming Using Fixed-Point Arithmetic, Computer Security – ESORICS 2010 (2010) ISBN:9783642154966 p.134-150, 10.1007/978-3-642-15497-3_9
  35. Hamada Koki, Kikuchi Ryo, Ikarashi Dai, Chida Koji, Takahashi Katsumi, Practically Efficient Multi-party Sorting Protocols from Comparison Sort Algorithms, Lecture Notes in Computer Science (2013) ISBN:9783642376818 p.202-216, 10.1007/978-3-642-37682-5_15
  36. Aly, A.: Network flow problems with secure multiparty computation. Ph.D. thesis, Universté catholique de Louvain, IMMAQ (2015)
  37. Cramer Ronald, Damgård Ivan, Ishai Yuval, Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation, Theory of Cryptography (2005) ISBN:9783540245735 p.342-362, 10.1007/978-3-540-30576-7_19