检索结果-内蒙古大学图书馆

30th International Conference on the Theory and Application of Cryptology and Information Security

作者： Ouyang, Ying Tang, Deng Xu, Yanhong Shanghai Jiao Tong Univ 800 Dongchuan Rd Shanghai 200240 Peoples R China

ISBN: (纸本)9789819609345;9789819609352

zero-knowledge (ZK) protocols allow a prover to demonstrate the truth of a statement without disclosing additional information about the underlying witness. Code-based cryptography has a long history but did suffer from periods of slow development. Recently, a prominent line of research have been contributing to designing efficient codebased ZK from MPC-in-the-head (Ishai et al., STOC 2007) and VOLE-in-the head (VOLEitH) (Baum et al., Crypto 2023) paradigms, resulting in quite efficient standard signatures. However, none of them could be directly used to construct privacy-preserving cryptographic primitives. Therefore, Stern's protocols remain to be the major technical stepping stones for developing advanced code-based privacy-preserving systems. This work proposes new code-based ZK protocols from VOLEitH paradigm for various relations and designs several code-based privacy-preserving systems that considerably advance the state-of-the-art in code-based cryptography. Our first contribution is a new ZK protocol for proving the correctness of a regular (non-linear) encoding process, which is utilized in many advanced privacy-preserving systems. Our second contribution are new ZK protocols for concrete code-based relations. In particular, we provide a ZK of accumulated values with optimal witness size for the accumulator (Nguyen et al., Asiacrypt 2019). Our protocols thus open the door for constructing more efficient privacy-preserving systems. Moreover, our ZK protocols have the advantage of being simpler, faster, and smaller compared to Stern-like protocols. To illustrate the effectiveness of our new ZK protocols, we develop ring signature scheme, group signature scheme, fully dynamic attribute-based signature scheme from our new ZK. The signature sizes of the resulting schemes are two to three orders of magnitude smaller than those based on Stern-like protocols in various parameter settings. Finally, our first ZK protocol yields a standard signature scheme, achieving

关键词： zero-knowledge protocols VOLE-in-the-head code-based cryptography privacy-preserving schemes signature scheme

来源：评论

学校读者我要写书评

暂无评论

Complementing zero-knowledge watermark detection: Proving properties of embedded information without revealing it

引用

MULTIMEDIA SYSTEMS 2005年第2期11卷 143-158页

作者： Adelsbach, A Rohe, M Sadeghi, AR Ruhr Univ Bochum Horst Gortz Inst IT Secur D-44780 Bochum Germany

zero-knowledge Watermark Detection (ZKWMD) is a promising and powerful means to improve the security of digital watermarking schemes in the context of various copyright-protection applications: in contrast to standard watermarking schemes, ZKWMD allows a proving party to prove to untrusted parties the presence of hidden information (embedded in digital data) without requiring to disclose this information or any other secrets necessary to detect its presence. However, typical applications presume the embedded information to have certain properties such as to be drawn from a specific probability distribution, and/or to have a specific form to counter ambiguity attacks. Hence, additional verifications must be performed that are more involved since the input to a ZKWMD protocol is cryptographically concealed. We present concrete and practical protocols to securely perform these verifications as complementary protocols to ZKWMD. In this context we consider two different approaches whose deployment depends on the underlying applications: the first one allows to securely prove that the concealed information (watermark) suffices certain desired properties, whereas the second approach allows both parties to jointly, securely and verifiably generate this information with the desired properties.

关键词： zero-knowledge protocols statistical tests on committed numbers interactive generation of commitments on Gaussian distributed samples zero-knowledge watermark detection

来源：评论

学校读者我要写书评

暂无评论

Policy-based signature scheme from lattices

引用

DESIGNS CODES AND CRYPTOGRAPHY 2016年第1期81卷 43-74页

作者： Cheng, Shantian Khoa Nguyen Wang, Huaxiong Nanyang Technol Univ Sch Phys & Math Sci Div Math Sci 21 Nanyang Link Singapore 637371 Singapore

Policy-based signature, introduced by Bellare and Fuchsbauer at PKC 2014, is a new type of digital signature in which a signer is only allowed to sign messages satisfying certain policy specified by the authority, but the signatures should not reveal the underlying policy. Having these features, policy-based signatures are attractive from both theoretical and practical aspects. In their pioneering paper, Bellare and Fuchsbauer have provided generic constructions of policy-based signatures, and a concrete instantiation based on pairings. In this work, we develop the recent techniques in lattice-based cryptography to construct a (delegatable) policy-based signature scheme from lattice assumptions. Specifically, we adapt Langlois et al.'s zero-knowledge argument system (PKC 2014) for the Bonsai tree signature scheme (Eurocrypt 2010) to enable the prover to convince the verifier that its secret witness satisfies an additional condition. Making the protocol non-interactive via the Fiat-Shamir transformation, we obtain a policy-based signature scheme supporting polynomially many policies, which satisfies the two security requirements (simulatability and extractability) in the random oracle model. Furthermore, our construction can be efficiently extended to a delegatable policy-based signature, thanks to the hierarchical structure of the Bonsai tree. Our contribution is twofold. On the one hand, we enrich the scope of policy-based signatures by providing the first quantum-resistant instantiation. On the other hand, our technical approach can potentially be applied to design a wide variety of privacy-enhanced lattice-based cryptographic constructions.

关键词： Policy-based signatures Lattice-based cryptography The Bonsai tree zero-knowledge protocols

来源：评论

学校读者我要写书评

暂无评论

Some facets of complexity theory and cryptography: a five-lecture tutorial

引用

ACM COMPUTING SURVEYS 2002年第4期34卷 504-549页

作者： Rothe, J Univ Dusseldorf Inst Informat D-40225 Dusseldorf Germany

In this tutorial, selected topics of cryptology and of computational complexity theory are presented. We give a brief overview of the history and the foundations of classical cryptography, and then move on to modern public-key cryptography. Particular attention is paid to cryptographic protocols and the problem of constructing key components of protocols such as one-way functions. A function is one-way if it is easy to compute, but hard to invert. We discuss the notion of one-way functions both in a cryptographic and in a complexity-theoretic setting. We also consider interactive proof systems and present some interesting zero-knowledge protocols. In a zero-knowledge protocol, one party can convince the other party of knowing some secret information without disclosing any bit of this information. Motivated by these protocols, we survey some complexity-theoretic results on interactive proof systems and related complexity classes.

关键词： algorithms security theory complexity theory interactive proof systems one-way functions public-key cryptography zero-knowledge protocols

来源：评论

学校读者我要写书评

暂无评论

Towards a formal system-to-system authentication protocol

引用

COMPUTER COMMUNICATIONS 1996年第12期19卷 954-961页

作者： Gritzalis, D Katsikas, S ATHENS UNIV ECON & BUSINESS DEPT INFORMATGR-10434 ATHENSGREECE

The problem of system-to-system authentication with the use of a password can be effectively facilitated through the use of either a probabilistic protocol or a zero-knowledge model. A combination of these two into a zero-knowledge probabilistic protocol has been demonstrated to be an efficient alternative approach to this problem. In the present paper, this combined protocol is restructured into a formal system-to-system login and authentication scheme, which is demonstrated to be not only secure but also generic and parametric enough to be usable in environments with different technological platforms and/or operational structures.

关键词： authentication zero-knowledge protocols probabilistic protocols passwords

来源：评论

学校读者我要写书评

暂无评论

Secure sealed-bid online auctions using discreet cryptographic proofs

引用

MATHEMATICAL AND COMPUTER MODELLING 2013年第11-12期57卷 2583-2595页

作者： Montenegro, Jose A. Fischer, Michael J. Lopez, Javier Peralta, Rene Univ Malaga ETSI Informat Malaga Dpto Lenguajes & Ciencias Comp E-29071 Malaga Spain Yale Univ Dept Comp Sci New Haven CT 06520 USA NIST Comp Secur Div Gaithersburg MD 20899 USA

This work describes the design and implementation of an auction system using secure multiparty computation techniques. Our aim is to produce a system that is practical under actual field constraints on computation, memory, and communication. The underlying protocol is privacy-preserving, that is, the winning bid is determined without information about the losing bids leaking to either the auctioneer or other bidders. Practical implementation of the protocol is feasible using circuit-based cryptographic proofs along with additively homomorphic bit commitment. Moreover, we propose the development of a Proof Certificate standard. These certificates convey sufficient information to recreate the cryptographic proofs and verify them offline. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Discreet proofs Multiparty computation Online auctions zero-knowledge protocols Proof certificates

来源：评论

学校读者我要写书评

暂无评论

Efficient authentication protocol with anonymity and key protection for mobile Internet users

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2020年第0期137卷 179-191页

作者： Jiang, Yan Zhu, Youwen Wang, Jian Xiang, Yong Nanjing Univ Aeronaut & Astronaut Coll Comp Sci & Technol Nanjing 211106 Peoples R China Deakin Univ Sch Informat Technol Melbourne Vic 3125 Australia Collaborat Innovat Ctr Novel Software Technol & I Nanjing 210023 Peoples R China Guilin Univ Elect Technol Guangxi Key Lab Trusted Software Guilin 541004 Peoples R China

To preserve user privacy and guarantee data confidentiality on the mobile Internet, it is crucial to secure communication between the mobile devices held by users and a remote server. In real applications, a serious threat against communication security is exposure of secret keys, due to the compromise of the mobile devices storing the key. One method of preserving key exposure is to use protected hardware or smart-cards, but they are costly and impractical. Another method is to utilize secret sharing to share secret key across multiple devices. Nevertheless, secret sharing schemes guarantee security only if the adversary cannot access at least one share in its entirety. In this paper, we present a remote authentication protocol, which resists key exposure. Further, we present a zero-knowledge protocol based on SDH assumption that can achieve anonymity. We formally prove our proposed solution is secure under the decision linear assumption and the q s -mSDH assumption in the random oracle model. Finally, we show our solution can achieve higher efficiency and stronger anonymity comparing with existing schemes, and thus the proposed solution is more suitable for real-world environments. (C) 2019 Elsevier Inc. All rights reserved.

关键词： Anonymity Key protection zero-knowledge protocols Mobile Internet

来源：评论

学校读者我要写书评

暂无评论

Signature scheme with message recovery and its application

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2004年第3期81卷 285-289页

作者： Sekhar, MR Indian Stat Inst Appl Stat Unit Kolkata 108 India

Recently Chen, [K. Chen, Signature with message recovery, Electronics Letters , 34(20) (1998) 1934], proposed a signature with message recovery. But Mitchell and Yeun [C. J. Mitchell and C. Y. Yeun, Comment - signature with message recovery, Electronics Letters , 35(3) (1999) 217] observed that Chen's scheme is only an authenticated encryption scheme and not a signature scheme as claimed. In this article, we propose a new signature scheme in the sense of Mitchell and Yeun and with message recovery feature. The designated verifier signature is introduced by Jakobsson et al. [M. Jakobsson, K. Sako, R. Impagliazzo, Designated verifier proofs and their applications, Proc. of Eurocrypt'96 , LNCS 1070 (1996) pp. 143-154]. We propose a designated verifier signature scheme with non-repudiation of origin. We also give a protocol for a convertible designated verifier signature scheme with non-repudiation of origin. Both of these schemes are based on our proposed signature scheme with message recovery.

关键词： cryptography digital signatures with message recovery authenticated encryption schemes zero-knowledge protocols designated verifier signatures with non- repudiation of origin

来源：评论

学校读者我要写书评

暂无评论

Locally random reductions: Improvements and applications

引用

JOURNAL OF CRYPTOLOGY 1997年第1期10卷 17-36页

作者： Beaver, D Feigenbaum, J Kilian, J Rogaway, P AT&T BELL LABS MURRAY HILL NJ 07974 USA NEC RES INST PRINCETON NJ 08540 USA UNIV CALIF DAVIS DEPT COMP SCI DAVIS CA 95616 USA

A (t, n)-locally random reduction maps a problem instance x into a set of problem instances y(1), ..., y(n) in such a way that it is easy to construct the answer to x from the answers to y(1), ..., y(n), and yet the distribution on t-element subsets of y(1), ..., y(n) depends only on \x\. In this paper we formalize such reductions and give improved methods for achieving them. Then we give a cryptographic application, showing a new way to prove in perfect zero knowledge that committed bits x(1), ..., x(m) satisfy some predicate Q. Unlike previous techniques for such perfect zero-knowledge proofs, ours uses an amount of communication that is bounded by a fixed polynomial in m, regardless of the computational complexity of Q.

关键词： random reducibility zero-knowledge protocols

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of a zero-knowledge Authentication Framework for Java Card

引用

INTERNATIONAL JOURNAL OF INFORMATION SECURITY AND PRIVACY 2011年第3期5卷 1-18页

作者： Patel, Ahmed Kalajdzic, Kenan Golafshan, Laleh Taghavi, Mona Univ Kebangsaan Malaysia Comp Sci Bangi Malaysia Kingston Univ Kingston Upon Thames Surrey England Ctr Comp Educ Tuzla Bosnia & Herceg Islamic Azad Univ Dept Comp Engn & IT Sci & Res Branch Fars Iran Islamic Azad Univ Dept Comp Sci & Res Branch Tehran Iran

zero-knowledge authentication protocols are an alternative to authentication protocols based on public key cryptography. Low processing and memory consumption make them especially suitable for implementation in smart card microprocessors, which are severely limited in processing power and memory space. This paper describes a design and implementation of a software library providing smart card application developers with a reliable authentication mechanism based on well-known zero-knowledge authentication schemes. Java Card is used as the target smart card platform implementation based on the evaluation of the Fiat-Shamir (F-S) and Guillou-Quisquater (G-Q) protocols under various performance criteria are presented to show the effectiveness of the implementation and that G-Q is a more efficient protocol.

关键词： Authentication Cryptography Fiat-Shamir Protocol Guillou-Quisquater Protocol Java Card Security Smart Cards zero-knowledge protocols

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：