IMPLEMENTING AUDITABILITY WITH NON-INTERACTIVE ZERO KNOWLEDGE PROOFS

被引:0
作者
Polic, Viktor D. [1 ]
机构
[1] Singidunum Univ, Belgrade, Serbia
来源
METALURGIA INTERNATIONAL | 2012年 / 17卷 / 11期
关键词
Non-interactive zero knowledge proofs; encryption; auditability; privacy;
D O I
暂无
中图分类号
TF [冶金工业];
学科分类号
0806 ;
摘要
Auditability or verifiability is an important requirement of every transaction processing information system. Implementing auditability while preserving privacy is of particular interest for information systems such as identity management, electronic voting, or cloud computing. This could be achieved by using zero knowledge proofs. Zero knowledge proofs are cryptographic methods used to verify correct participation in a distributed protocol without revealing any additional information. This paper gives an overview of zero knowledge proofs focusing on the most recent development and the implementation of the non-interactive type.
引用
收藏
页码:106 / 111
页数:6
相关论文
共 16 条
  • [1] [Anonymous], 2003, INFORM THEORY INFERE
  • [2] [Anonymous], 1991, Journal of the ACM (JACM)
  • [3] Balasch Josep, 2010, P 19 USENIX C SEC
  • [4] Bellare Mihir, 2011, LECT NOTES COMPUTER, V6650, P114, DOI [10.1007/978-3-642-22670-0_14,2011, DOI 10.1007/978-3-642-22670-0_14]
  • [5] Blum Manuel, 1988, P STOC 88 P 20 ANN A
  • [6] HOW TO PROVE YOURSELF - PRACTICAL SOLUTIONS TO IDENTIFICATION AND SIGNATURE PROBLEMS
    FIAT, A
    SHAMIR, A
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1987, 263 : 186 - 194
  • [7] GOLDREICH O, 2004, FDN CRYPTOGRAPHY BAS, DOI DOI 10.1017/CBO9780511721656
  • [8] Goldwasser Shafi, 1985, STOC 85 P 17 ANN ACM
  • [9] Goodrich Michael T., 2011, CODASPY 11 P 1 ACM C
  • [10] Groth J, 2006, LECT NOTES COMPUT SC, V4117, P97