Go to the corresponding LIPIcs Volume Portal 
Scheder, Dominik ; Tang, Shuyang ; Zhang, Jiaheng
pdfformat: 

@InProceedings{scheder_et_al:LIPIcs:2019:11527, author = {Dominik Scheder and Shuyang Tang and Jiaheng Zhang}, title = {{Searching for Cryptogenography Upper Bounds via Sum of Square Programming}}, booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)}, pages = {31:131:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771306}, ISSN = {18688969}, year = {2019}, volume = {149}, editor = {Pinyan Lu and Guochuan Zhang}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2019/11527}, URN = {urn:nbn:de:0030drops115276}, doi = {10.4230/LIPIcs.ISAAC.2019.31}, annote = {Keywords: Communication Complexity, Secret Leaking, Sum of Squares Programming} }
Keywords:  Communication Complexity, Secret Leaking, Sum of Squares Programming  
Collection:  30th International Symposium on Algorithms and Computation (ISAAC 2019)  
Issue Date:  2019  
Date of publication:  28.11.2019  
Supplementary Material:  http://basics.sjtu.edu.cn/~dominik/soscryptogenography/ 