![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Liangliang Xiao
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [c17]Xunyu Pan, Timothy J. Cross, Liangliang Xiao, Xiali Hei:
Musical examination to bridge audio data and sheet music. IMAWM 2015: 94080J - 2013
- [j6]Manghui Tu, Hui Ma, Liangliang Xiao, I-Ling Yen, Farokh B. Bastani, Dianxiang Xu:
Data Placement in P2P Data Grids Considering the Availability, Security, Access Performance and Load Balancing. J. Grid Comput. 11(1): 103-127 (2013) - [c16]Yunqi Ye, Liangliang Xiao, Yinzi Chen, I-Ling Yen, Farokh B. Bastani, Ing-Ray Chen:
Access Protocols in Data Partitioning Based Cloud Storage. IEEE CLOUD 2013: 398-405 - [c15]Manghui Tu, Liangliang Xiao, Dianxiang Xu:
Maximizing the Availability of Replicated Services in Widely Distributed Systems Considering Network Availability. SERE 2013: 178-187 - 2012
- [c14]Liangliang Xiao, I-Ling Yen:
Security analysis for order preserving encryption schemes. CISS 2012: 1-6 - [c13]Liangliang Xiao, Farokh B. Bastani, I-Ling Yen, Raymond A. Paul:
Information Assurance for Real-Time Decision Support. ISORC Workshops 2012: 150-155 - [i6]Liangliang Xiao, I-Ling Yen:
Security Analysis and Enhancement for Prefix-Preserving Encryption Schemes. IACR Cryptol. ePrint Arch. 2012: 191 (2012) - [i5]Liangliang Xiao, I-Ling Yen, Dung T. Huynh:
Extending Order Preserving Encryption for Multi-User Systems. IACR Cryptol. ePrint Arch. 2012: 192 (2012) - [i4]Liangliang Xiao, Osbert Bastani, I-Ling Yen:
An Efficient Homomorphic Encryption Protocol for Multi-User Systems. IACR Cryptol. ePrint Arch. 2012: 193 (2012) - [i3]Liangliang Xiao, I-Ling Yen:
A Note for the Ideal Order-Preserving Encryption Object and Generalized Order-Preserving Encryption. IACR Cryptol. ePrint Arch. 2012: 350 (2012) - 2011
- [c12]Yunqi Ye, Liangliang Xiao, I-Ling Yen, Farokh B. Bastani:
Leveraging Service Clouds for Power and QoS Management for Mobile Devices. IEEE CLOUD 2011: 235-242 - 2010
- [c11]Liangliang Xiao, Yunqi Ye, I-Ling Yen, Farokh B. Bastani:
Evaluation and Comparisons of Dependable Distributed Storage Designs for Clouds. HASE 2010: 152-161 - [c10]Liangliang Xiao, I-Ling Yen, Farokh B. Bastani:
Scalable Authentication and Key Management in SCADA. ICPADS 2010: 172-179 - [c9]Yunqi Ye, Liangliang Xiao, I-Ling Yen, Farokh B. Bastani:
Cloud Storage Design Based on Hybrid of Replication and Data Partitioning. ICPADS 2010: 415-422 - [c8]Yunqi Ye, Liangliang Xiao, I-Ling Yen, Farokh B. Bastani:
Secure, Dependable, and High Performance Cloud Storage. SRDS 2010: 194-203
2000 – 2009
- 2008
- [j5]Zhifang Zhang, Mulan Liu, Liangliang Xiao:
Rearrangements of access structures and their realizations in secret sharing schemes. Discret. Math. 308(21): 4882-4891 (2008) - [c7]Liangliang Xiao, I-Ling Yen, Farokh B. Bastani:
Security in a peer-to-peer data grid storage system. CSIIRW 2008: 28:1-28:3 - [c6]Liangliang Xiao, I-Ling Yen, Farokh B. Bastani:
Low Cost Secure Computation for the General Client-Server Computation Model. HASE 2008: 19-26 - [c5]Yunqi Ye, I-Ling Yen, Liangliang Xiao, Bhavani Thuraisingham:
Secure, Highly Available, and High Performance Peer-to-Peer Storage Systems. HASE 2008: 383-391 - 2007
- [j4]Mulan Liu, Liangliang Xiao, Zhifang Zhang:
Multiplicative Linear Secret Sharing Schemes Based on Connectivity of Graphs. IEEE Trans. Inf. Theory 53(11): 3973-3978 (2007) - [c4]Manghui Tu, Liangliang Xiao, Hui Ma, I-Ling Yen, Farokh B. Bastani:
Placement in Dependable and Secure Peer-to-Peer Data Grids. HASE 2007: 133-140 - [c3]Liangliang Xiao, I-Ling Yen, Yanjin Zhang, Farokh B. Bastani:
Evaluating Dependable Distributed Storage Systems. PDPTA 2007: 948-954 - 2006
- [j3]Mulan Liu, Liangliang Xiao, Zhifang Zhang:
Linear multi-secret sharing schemes based on multi-party computation. Finite Fields Their Appl. 12(4): 704-713 (2006) - [j2]Manghui Tu, Peng Li, Liangliang Xiao, I-Ling Yen, Farokh B. Bastani:
Replica Placement Algorithms for Mobile Transaction Systems. IEEE Trans. Knowl. Data Eng. 18(7): 954-970 (2006) - 2005
- [j1]Liangliang Xiao, Mulan Liu:
Linear multi-secret sharing schemes. Sci. China Ser. F Inf. Sci. 48(1): 125-136 (2005) - [c2]Zhifang Zhang, Mulan Liu, Liangliang Xiao:
Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes. ASIACRYPT 2005: 156-173 - [c1]Qingkai Ma, Liangliang Xiao, I-Ling Yen, Manghui Tu, Farokh B. Bastani:
An Adaptive Multiparty Protocol for Secure Data Protection. ICPADS (1) 2005: 43-49 - [i2]Liangliang Xiao, Mulan Liu, Zhifang Zhang:
Multiparty Computation Based on Connectivity of Graphs. IACR Cryptol. ePrint Arch. 2005: 143 (2005) - [i1]Liangliang Xiao, Mulan Liu, Zhifang Zhang:
Statistical Multiparty Computation Based on Random Walks on Graphs. IACR Cryptol. ePrint Arch. 2005: 337 (2005)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint