[1] |
GARCIA-MOLINA H , ULLMAN J D , WIDOM J . Database System Implementation[M]. Prentice Hall, 2000.
|
[2] |
?ZSU M T , VALDURIEZ P . Principles of Distributed Database Systems[M]. Springer, 2011.
|
[3] |
GREEN M , HOHENBERGER S . Blind identity-based encryption and simulatable oblivious transfer[A]. Asiacrypt’07[C]. 2007. 265-282.
|
[4] |
SHI E , BETHENCOURT J , CHAN T H H ,et al. Multi-dimensional range query over encrypted data[A]. IEEE Symposium on Security and Privacy[C]. 2007. 350-364.
|
[5] |
BONEH D , WATERS B . Conjunctive,subset,and range queries on encrypted data[A]. Theory of Cryptography[C]. Springer Berlin Heidelberg, 2007. 535-554.
|
[6] |
ABDALLA M , BELLARE M , CATALANO D ,et al. Searchable encryption revisited:Consistency properties,relation to anonymous IBE,and extensions[J]. Journal of Cryptology, 2008,21(3): 350-391.
|
[7] |
BLAKE I F , KOLESNIKOV V . Conditional encrypted mapping and comparing encrypted numbers[A]. Proceedings of the 10th international conference on Financial Cryptography and Data Security[C]. Springer-Verlag, 2006. 206-220.
|
[8] |
HAZAY C , LINDELL Y . Efficient protocols for set intersection and pattern matching with security against malicious and covert adver-saries[A]. Theory of Cryptography[C]. Springer Berlin Heidelberg, 2008. 155-175.
|
[9] |
KISSNER L , SONG D . Privacy-preserving set operations[A]. Cryptology–CRYPTO 2005[C]. Springer Berlin Heidelberg, 2005. 241-257.
|
[10] |
LINDELL Y , PINKAS B . Privacy preserving data mining[J]. Journal of Cryptology, 2002,15(3): 177-206.
|
[11] |
GOLDREICH O . Foundations of Cryptography:Volume 2,Basic Applications[M]. Cambridge University Press, 2009.
|
[12] |
CANETTI R . Universally composable security:a new paradigm for cryptographic protocols[A]. IEEE Symposium on Foundations of Computer Science IEEE[C]. 2001. 136-145.
|
[13] |
CANETTI R , DODIS Y , PASS R ,et al. Universally composable security with global setup[A]. TCC’07[C]. 2007. 61-85.
|
[14] |
GARAY J A , MACKENZIE P , Yang K . Strengthening zero-knowledge protocols using signatures[A]. Advances in Cryptology—Eurocrypt 2003[C]. Springer Berlin Heidelberg, 2003. 177-194.
|
[15] |
MACKENZIE P , YANG K . On simulation-sound trapdoor commitments[A]. Cryptology-EUROCRYPT 2004[C]. Springer Berlin Heidelberg, 2004. 382-400.
|
[16] |
DODIS Y , SHOUP V , WALFISH S . Efficient constructions of composable commitments and zero-knowledge proofs[A]. Proc Crypt’08[C]. 2008. 515-535.
|
[17] |
GENTRY C . Practical identity-based encryption without random oracles[A]. Eurocrypt’06[C]. 2006. 445-464.
|
[18] |
BOYEN X , WATERS B . Anonymous hierarchical identity-based encryption (without random oracles)[A]. Crypto’06[C]. 2006. 290-307.
|
[19] |
BELLARE M , NAMPREMPRE C , NEVEN G . Security proofs for identity-based identification and signature schemes[J]. Journal of Cryptology, 2009,22(1): 1-61.
|
[20] |
李顺东, 王道顺 . 基于同态加密的高效多方保密计算[J]. 电子学报, 2013,41(4): 798-803. LI S D , WANG D H . Efficient secure multiparty computation based on homomorphic[J].Encryption Acta Electronica Sinica 2013,41(4):798-803.Encryption Acta Electronica Sinica 2013,41(4): 798-803.
|
[21] |
夏峰, 杨波, 张明武 等. 基于 LWE 的集合相交和相等的两方保密计算[J]. 电子与信息学报, 2012,34(2): 462-467. XIA F , YANG B , ZHANG M W ,et al. Secure two-party computation for set intersection and set equality problems based on LWE[J]. Journal of Electronics & Information Technology, 2012,34(2): 462-467.
|
[22] |
GROTH J , SAHAI A . Efficient non-interactive proof systems for bilinear groups[A]. Proc Eurocrypt[C]. 2008. 415-432.
|
[23] |
田有亮, 彭长根, 马建峰 等. 通用可组合公平安全多方计算协议[J]. 通信学报, 2014,35(2): 54-62. TIAN Y L , PENG C G , MA J F ,et al. Universally composable secure multiparty computation protocol with fairness[J]. Journal on Communications, 2014,35(2): 54-62.
|
[24] |
IZABACHENE M , POINTCHEVAL D . New anonymity notions for identity-based encryption[A]. Security and Cryptography for Networks[C]. Springer Berlin Heidelberg, 2008. 375-391.
|