Остановите войну!
for scientists:
default search action
Yongge Wang
- > Home > Persons > Yongge Wang
Publications
- 2017
- [c42]Mayur Punekar, Qutaibah M. Malluhi, Yongge Wang, Yvo Desmedt:
Candidate MDS Array Codes for Tolerating Three Disk Failures in RAID-7 Architectures. BDCAT 2017: 33-42 - [c41]Mayur Punekar, Qutaibah M. Malluhi, Yvo Desmedt, Yongge Wang:
Computational Aspects of Ideal (t, n)-Threshold Scheme of Chen, Laing, and Martin. CANS 2017: 470-481 - 2014
- [c33]Yongge Wang, Yvo Desmedt:
Efficient secret sharing schemes achieving optimal information rate. ITW 2014: 516-520 - 2012
- [i16]Yongge Wang, Yvo Desmedt:
Edge-Colored Graphs with Applications To Homogeneous Faults. CoRR abs/1207.5439 (2012) - 2011
- [j20]Yongge Wang, Yvo Desmedt:
Edge-colored graphs with applications to homogeneous faults. Inf. Process. Lett. 111(13): 634-641 (2011) - [c29]Yongge Wang, Yvo Desmedt:
Homogeneous Faults, Colored Edge Graphs, and Cover Free Families. ICITS 2011: 58-72 - 2008
- [j19]Yongge Wang, Yvo Desmedt:
Perfectly Secure Message Transmission Revisited. IEEE Trans. Inf. Theory 54(6): 2582-2595 (2008) - 2006
- [c26]Yvo Desmedt, Yongge Wang, Mike Burmester:
Revisiting Colored Networks and Privacy Preserving Censorship. CRITIS 2006: 140-150 - 2005
- [c25]Yvo Desmedt, Yongge Wang, Reihaneh Safavi-Naini, Huaxiong Wang:
Radio Networks with Reliable Communication. COCOON 2005: 156-166 - [c22]Yvo Desmedt, Yongge Wang, Mike Burmester:
A Complete Characterization of Tolerable Adversary Structures for Secure Point-to-Point Transmissions Without Feedback. ISAAC 2005: 277-287 - 2004
- [j14]Yvo Desmedt, Yongge Wang:
Analyzing Vulnerabilities Of Critical Infrastructures Using Flows And Critical Vertices In And/Or Graphs. Int. J. Found. Comput. Sci. 15(1): 107-125 (2004) - 2002
- [c13]Yvo Desmedt, Yongge Wang:
Maximum Flows and Critical Vertices in AND/OR Graphs. COCOON 2002: 238-248 - [c12]Yvo Desmedt, Yongge Wang:
Perfectly Secure Message Transmission Revisited. EUROCRYPT 2002: 502-517 - [c11]Yvo Desmedt, Yongge Wang:
Efficient Zero-Knowledge Proofs for Some Practical Graph Problems. SCN 2002: 290-302 - [i3]Yvo Desmedt, Yongge Wang:
Perfectly Secure Message Transmission Revisited. CoRR cs.CR/0208041 (2002) - [i2]Yvo Desmedt, Yongge Wang:
Perfectly Secure Message Transmission Revisited. IACR Cryptol. ePrint Arch. 2002: 128 (2002) - 2001
- [j10]Yongge Wang, Yvo Desmedt:
Secure Communication in Multicast Channels: The Answer to Franklin and Wright's Question. J. Cryptol. 14(2): 121-135 (2001) - 2000
- [j7]Yongge Wang, Yvo Desmedt, Mike Burmester:
Models For Dependable Computation with Multiple Inputs and Some Hardness Results. Fundam. Informaticae 42(1): 61-73 (2000) - 1999
- [c9]Yvo Desmedt, Yongge Wang:
Approximation Hardness and Secure Communication in Broadcast Channels. ASIACRYPT 1999: 247-257 - [c7]Yongge Wang, Yvo Desmedt:
Secure Communication in Broadcast Channels: The Answer to Franklin and Wright's Question. EUROCRYPT 1999: 446-458 - 1998
- [c6]Mike Burmester, Yvo Desmedt, Yongge Wang:
Using Approximation Hardness to Achieve Dependable Computation. RANDOM 1998: 172-186
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-11-13 23:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint