http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : ( Fangguo Zhang ) (검색결과 3 건)
- 무료
- 기관 내 무료
- 유료
-
Ciphertext policy attribute-based encryption supporting unbounded attribute space from R-LWE
( Zehong Chen ),( Peng Zhang ),( Fangguo Zhang ),( Jiwu Huang ) 한국인터넷정보학회 2017 KSII Transactions on Internet and Information Syst Vol.11 No.4
Ciphertext policy attribute-based encryption (CP-ABE) is a useful cryptographic technology for guaranteeing data confidentiality but also fine-grained access control. Typically, CP-ABE can be divided into two classes: small universe with polynomial attribute space and large universe with unbounded attribute space. Since the learning with errors over rings (R-LWE) assumption has characteristics of simple algebraic structure and simple calculations, based on R-LWE, we propose a small universe CP-ABE scheme to improve the efficiency of the scheme proposed by Zhang et al. (AsiaCCS 2012). On this basis, to achieve unbounded attribute space and improve the expression of attribute, we propose a large universe CP-ABE scheme with the help of a full-rank differences function. In this scheme, all polynomials in the R-LWE can be used as values of an attribute, and these values do not need to be enumerated at the setup phase. Different trapdoors are used to generate secret keys in the key generation and the security proof. Both proposed schemes are selectively secure in the standard model under R-LWE. Comparison with other schemes demonstrates that our schemes are simpler and more efficient. R-LWE can obtain greater efficiency, and unbounded attribute space means more flexibility, so our research is suitable in practices.
-
How to retrieve the encrypted data on the blockchain
( Huige Li ),( Fangguo Zhang ),( Peiran Luo ),( Haibo Tian ),( Jiejie He ) 한국인터넷정보학회 2019 KSII Transactions on Internet and Information Syst Vol.13 No.11
Searchable symmetric encryption (SSE) scheme can perform search on encrypted data directly without revealing the plain data and keywords. At present, many constructive SSE schemes were proposed. However, they cannot really resist the malicious adversary, because it (i.e., the cloud server) may delete some important data. As a result, it is very likely that the returned search results are incorrect. In order to better guarantee the integrity of outsourcing data, and ensure the correction of returned search results at the same time, in this paper, we combine SSE with blockchain (BC), and propose a SSE-on-BC framework model. We then construct two concrete schemes based on the size of the data, which can better provide privacy protection and integrity verification for data. Lastly, we present their security and performance analyses, which show that they are secure and feasible.
-
New receipt-free voting scheme using double-trapdoor commitment
Chen, Xiaofeng,Wu, Qianhong,Zhang, Fangguo,Tian, Haibo,Wei, Baodian,Lee, Byoungcheon,Lee, Hyunrok,Kim, Kwangjo Elsevier 2011 Information sciences Vol.181 No.8
<P><B>Abstract</B></P><P>It is considered to be the most suitable solution for large scale elections to design an electronic voting scheme using blind signatures and anonymous channels. Based on this framework, Okamoto first proposed a receipt-free voting scheme <ce:cross-ref refid='b0150'>[30]</ce:cross-ref> for large scale elections. However, in the following paper, Okamoto <ce:cross-ref refid='b0155'>[31]</ce:cross-ref> proved that the scheme <ce:cross-ref refid='b0150'>[30]</ce:cross-ref> was not receipt-free and presented two improved schemes. One scheme requires the help of the parameter registration committee and the other needs a stronger physical assumption of the voting booth. In this paper, we utilize the double-trapdoor commitment to propose a new receipt-free voting scheme based on blind signatures for large scale elections. Neither the parameter registration committee nor the voting booth is required in our scheme. We also present a more efficient zero-knowledge proof for secret permutation. Therefore, our scheme is much more efficient than Okamoto’s schemes <ce:cross-refs refid='b0150 b0155'>[30,31]</ce:cross-refs> with the weaker physical assumptions. Moreover, we prove that our scheme can achieve the desired security properties.</P>
ScienceON
KISS연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
