| [1] |
MEIKLEJOHN S , POMAROLE M , JORDAN G ,et al. A fistful of bitcoins:characterizing payments among men with no names[C]// The 2013 Conference on Internet Measurement Conference,October 23-25,2013,Barcelona,Spain. New York:ACM Press, 2013: 127-140.
|
| [2] |
SASSON E B , CHIESA A , GARMAN C ,et al. Zerocash:decentralized anonymous payments from Bitcoin[C]// The 2014 IEEE Symposium on Security and Privacy,May 18-21,2014,San Jose,USA. Washington,DC:IEEE Computer Society, 2014: 459-474.
|
| [3] |
JENS G , . Short pairing-based non-interactive zero-knowledge arguments[C]// The 16th International Conference on the Theory and Application of Cryptology and Information Security,December 5-9,2010,Singapore. Heidelberg:Springer, 2010: 321-340.
|
| [4] |
LIPMAA H , . Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments[C]// The 9th International Conference on Theory of Cryptography,March 18-21,2012,Sicily,Italy. Heidelberg:Springer-Verlag, 2012: 169-189.
|
| [5] |
NIR B , ALESSANDRO C , YUVAL I . Succinct non-interactive arguments via linear interactive proofs[C]// The 10th Theory of Cryptography Conference on Theory of Cryptography,March 3-6,2013,Tokyo,Japan. Heidelberg:SpringerVerlag, 2013: 315-333.
|
| [6] |
GENNARO R , GENTRY C , PARNO B ,et al. Quadratic span programs and succinct NIZKs without PCPs[C]// The 32nd Annual International Conference on the Theory ＆ Applications of Cryptographic Techniques,May 26-30,2013,Athens,Greece.[S.l.:s.n], 2013: 626-645.
|
| [7] |
PARNO B , HOWELL J , GENTRY C ,et al. Pinocchio:nearly practical verifiable computation[C]// The 2013 IEEE Symposium on Security ＆ Privacy,May 19-22,2013,San Francisco,USA. Washington,DC:IEEE Computer Society, 2013: 103-112.
|
| [8] |
BEN-SASSON E , CHIESA A , GENKIN D ,et al. Verifying program executions succinctly and in zero knowledge[C]// The 33rd International Cryptology Conference(CRYPTO 2013),August 18-22,2013,Santa Barbara,USA. Heidelberg:Springer-Verlag, 2013: 90-108.
|
| [9] |
LIPMAA H , . Succinct non-interactive zero knowledge arguments from span programs and linear eror-correcting codes[C]// The 19th International Conference on Advances in Cryptology,December 1-5,2013,Bangalore,India.New York:Springer-Verlag New York,Inc, 2013: 41-60.
|
| [10] |
BEN-SASSON E , CHIESA A , TROMER E ,et al. Succinct non-interactive zero knowledge for a von neumann architecture[C]// The 23rd USENIX Conference on Security Symposium,August 20-22,2014,San Diego,USA. Berkeley:USENIX Association, 2014: 781-796.
|
| [11] |
BEN-SASSON E , CHIESA A , GREEN M ,et al. Secure sampling of public parameters for succinct zero knowledge proofs[C]// 2015 IEEE Symposium on Security and Privacy (SP),May 18-21,2015,San Jose,USA. Piscataway:IEEE Press, 2015: 287-304.
|
| [12] |
PEREIRA G C C F , JR M A S , NAEHRIG M ,et al. A family of implementationfriendly BN elliptic curves[J]. Journal of Systems and Software, 2011,84(8): 1319-1326.
|
| [13] |
ARANHA D F , FUENTES-CASTA?EDA L , KNAPP E ,et al. Implementing pairings at the 192-bit security level[C]// The 5th International Conference on PairingBased Cryptography,May 16-18,2012,Cologne,Germany. Heidelberg:SpringerVerlag, 2012: 177-195.
|
| [14] |
MENEZES A , SARKAR P , SINGH S . Challenges with assessing the impact of nfs advances on the security of pairing-based cryptography[C]// International Conference on Cryptology,December 1-2,2016,Kuala Lumpur,Malaysia. Heidelberg:SpringerVerlag, 2016: 83-108.
|
