{"id":"https://openalex.org/W1744431010","doi":"https://doi.org/10.1017/s096354830200559x","title":"Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography","display_name":"Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography","publication_year":2003,"publication_date":"2003-05-01","ids":{"openalex":"https://openalex.org/W1744431010","doi":"https://doi.org/10.1017/s096354830200559x","mag":"1744431010"},"language":"en","primary_location":{"id":"doi:10.1017/s096354830200559x","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s096354830200559x","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088337575","display_name":"Matthias Krause","orcid":"https://orcid.org/0000-0002-3200-3199"},"institutions":[{"id":"https://openalex.org/I177802217","display_name":"University of Mannheim","ror":"https://ror.org/031bsb921","country_code":"DE","type":"education","lineage":["https://openalex.org/I177802217"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"MATTHIAS KRAUSE","raw_affiliation_strings":["Theoretische Informatik, Universit\u00e4t Mannheim, D-68131 Mannheim, Germany (e-mail:","Theoretische Informatik, Universit\u00e4t Mannheim, D-68131 Mannheim, Germany (e-mail: krause@th.informatik.uni-mannheim.de)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Theoretische Informatik, Universit\u00e4t Mannheim, D-68131 Mannheim, Germany (e-mail:","institution_ids":["https://openalex.org/I177802217"]},{"raw_affiliation_string":"Theoretische Informatik, Universit\u00e4t Mannheim, D-68131 Mannheim, Germany (e-mail: krause@th.informatik.uni-mannheim.de)","institution_ids":["https://openalex.org/I177802217"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032272542","display_name":"Hans Ulrich Simon","orcid":"https://orcid.org/0000-0002-1587-0944"},"institutions":[{"id":"https://openalex.org/I904495901","display_name":"Ruhr University Bochum","ror":"https://ror.org/04tsk2644","country_code":"DE","type":"education","lineage":["https://openalex.org/I904495901"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"HANS ULRICH SIMON","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Mathematik, Ruhr-Universit\u00e4t Bochum, D-44780 Bochum, Germany (e-mail:","Fakult\u00e4t f\u00fcr Mathematik, Ruhr-Universit\u00e4t Bochum, D-44780 Bochum, Germany (e-mail: simon@lmi.ruhr-uni-bochum.de)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Mathematik, Ruhr-Universit\u00e4t Bochum, D-44780 Bochum, Germany (e-mail:","institution_ids":["https://openalex.org/I904495901"]},{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Mathematik, Ruhr-Universit\u00e4t Bochum, D-44780 Bochum, Germany (e-mail: simon@lmi.ruhr-uni-bochum.de)","institution_ids":["https://openalex.org/I904495901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088337575"],"corresponding_institution_ids":["https://openalex.org/I177802217"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07911503,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":"3","first_page":"285","last_page":"299"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10388","display_name":"Advanced Steganography and Watermarking Techniques","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/contrast","display_name":"Contrast (vision)","score":0.8264771103858948},{"id":"https://openalex.org/keywords/secret-sharing","display_name":"Secret sharing","score":0.7200548052787781},{"id":"https://openalex.org/keywords/infinity","display_name":"Infinity","score":0.6410970091819763},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.6259609460830688},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.623197078704834},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5844773054122925},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5566824674606323},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5494949817657471},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.5370134115219116},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4803087115287781},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24647828936576843},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17313766479492188},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.05935627222061157}],"concepts":[{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.8264771103858948},{"id":"https://openalex.org/C3087436","wikidata":"https://www.wikidata.org/wiki/Q1386603","display_name":"Secret sharing","level":3,"score":0.7200548052787781},{"id":"https://openalex.org/C7321624","wikidata":"https://www.wikidata.org/wiki/Q205","display_name":"Infinity","level":2,"score":0.6410970091819763},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.6259609460830688},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.623197078704834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5844773054122925},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5566824674606323},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5494949817657471},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.5370134115219116},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4803087115287781},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24647828936576843},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17313766479492188},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.05935627222061157},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s096354830200559x","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s096354830200559x","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:ub-madoc.bib.uni-mannheim.de:59722","is_oa":false,"landing_page_url":"https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/determining-the-optimal-contrast-for-secret-sharing-schemes-in-visual-cryptography/4D249934E17F96B19134E7737077C29F","pdf_url":null,"source":{"id":"https://openalex.org/S4377196315","display_name":"MADOC (University of Mannheim)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177802217","host_organization_name":"University of Mannheim","host_organization_lineage":["https://openalex.org/I177802217"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Zeitschriftenartikel"},{"id":"pmh:oai:ub-madoc.bib.uni-mannheim.de:59731","is_oa":false,"landing_page_url":"https://eccc.weizmann.ac.il/report/2000/003/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196315","display_name":"MADOC (University of Mannheim)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177802217","host_organization_name":"University of Mannheim","host_organization_lineage":["https://openalex.org/I177802217"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Arbeitspapier"},{"id":"mag:1744431010","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc7.html#ECCC-TR00-003","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1516390128","https://openalex.org/W1574306078","https://openalex.org/W1599335667","https://openalex.org/W2007407491","https://openalex.org/W2031845933","https://openalex.org/W2046251989","https://openalex.org/W2053913299","https://openalex.org/W2062010115","https://openalex.org/W2093796999","https://openalex.org/W2913419753"],"related_works":["https://openalex.org/W1695831070","https://openalex.org/W2586001589","https://openalex.org/W3121736839","https://openalex.org/W3086270023","https://openalex.org/W2794870184","https://openalex.org/W2996151083","https://openalex.org/W2535739715","https://openalex.org/W1410181322","https://openalex.org/W2950671552","https://openalex.org/W2473929938","https://openalex.org/W1598977140","https://openalex.org/W2585924709","https://openalex.org/W2396759562","https://openalex.org/W2887133168","https://openalex.org/W1479821208","https://openalex.org/W3202463021","https://openalex.org/W2773230975","https://openalex.org/W3128288149","https://openalex.org/W2949361809","https://openalex.org/W2966900502"],"abstract_inverted_index":{"This":[0,32],"paper":[1],"shows":[2],"that":[3,25,34,63],"the":[4,35,42,52,90,100],"largest":[5,36,91],"possible":[6,37,92,102],"contrast":[7,38,93],"$C_{k,n}$":[8],"in":[9,41,94,105,108],"a":[10,87,95],"$k$":[11,67],"-out-of-":[12],"$n$":[13,45,50,62],"secret":[14,96],"sharing":[15,97],"scheme":[16,98],"is":[17],"approximately":[18],"$4^{-(k-1)}$":[19,40],".":[20,31],"More":[21],"precisely,":[22],"we":[23,69],"show":[24],"$4^{-(k-1)}":[26],"\\leq":[27,29],"C_{k,n}":[28],"4^{-(k-1)}n^k/(n(n-1)\\cdots(n-(k-1)))$":[30],"implies":[33],"equals":[39],"limit":[43],"when":[44],"approaches":[46],"infinity.":[47],"For":[48,59],"large":[49],",":[51,68],"above":[53],"bounds":[54,73],"leave":[55],"almost":[56],"no":[57],"gap.":[58],"values":[60],"of":[61,81],"come":[64],"close":[65],"to":[66],"will":[70],"present":[71],"alternative":[72],"(being":[74],"tight":[75],"for":[76],"$n=k$":[77],").":[78],"The":[79],"proofs":[80],"our":[82],"results":[83],"proceed":[84],"by":[85],"finding":[86],"relationship":[88],"between":[89],"and":[99],"smallest":[101],"approximation":[103,109],"error":[104],"problems":[106],"occurring":[107],"theory.":[110]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}