{"doi":"10.5121/ijnsa.2011.3106","title":"Failure of A Mix Network","abstract":null,"journal":"International Journal of Network Security & Its Applications","year":2011,"id":608871,"datarank":0.16479184330021646,"base_score":1.0986122886681096,"endowment":1.0986122886681096,"self_citation_contribution":0.16479184330021646,"citation_network_contribution":0.0,"self_endowment_contribution":0.16479184330021646,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":2,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":209889,"name":"Kun Peng","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"Failure of A Mix Network","abstract":"A mix network by Wikstrom fails in correctness, provable privacy and soundness. Its claimed advantages in security and efficiency are compromised. The analysis in this paper illustrates that although the first two failures may be fixed by modifying the shuffling protocol, the last one is too serious to fix at a tolerable cost. Especially, an attack is proposed to show how easily soundness of the shuffling scheme can be compromised. Moreover, the most surprising discovery in this paper is that it is formally illustrated that in practice it is impossible to fix soundness of the shuffling scheme by Wikstrom.","is_dataset_classified":null,"base_score":1.0986122886681096,"endowment":1.0986122886681096,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"21097893","pmcid":null,"openalex_id":"https://openalex.org/W2090568800","authors":[],"funders":[],"total_grants":0,"fwci":0.4559,"citation_percentile":0.77224369,"influential_citations":0,"citation_trend":[{"year":2013,"count":1},{"year":2017,"count":1}],"oa_status":"bronze","license":"cc-by","oa_locations":[{"url":"https://doi.org/10.5121/ijnsa.2011.3106","host_type":"journal"},{"url":"https://doi.org/10.5121/ijnsa.2011.3106","host_type":"publisher"},{"url":"http://doi.org/10.5121/ijnsa.2011.3106","host_type":"journal"},{"url":"http://arxiv.org/abs/1101.5449","host_type":"repository"},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.2451","host_type":""},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.743.2242","host_type":""},{"url":"https://zenodo.org/record/1404732","host_type":"repository"},{"url":"https://arxiv.org/pdf/1101.5449","host_type":"repository"}],"fields_of_study":["Cryptography and Data Security","Cryptographic Implementations and Security","Internet Traffic Analysis and Secure E-voting"],"mesh_terms":[],"keywords":["Shuffling","Soundness","Correctness","Computer science","Scheme (mathematics)","Protocol (science)","Computer security","Theoretical computer science","Algorithm","Mathematics","Programming language","Network","Security"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Peace, Justice and strong institutions"}],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-07-30T23:32:48.806026Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}