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

20th Annual Network and Distributed System Security Symposium, NDSS 2013

作者： Asghar, Hassan Jameel Steinfeld, Ron Li, Shujun Pieprzyk, Josef Centre for Advanced Computing Algorithms and Cryptography Department of Computing Faculty of Science Macquarie University Sydney Australia Clayton School of Information Technology Faculty of Information Technology Monash University Clayton Australia Department of Computing Faculty of Engineering and Physical Sciences University of Surrey Guildford Surrey United Kingdom

At NDSS 2012, Yan et al. analyzed the security of several challenge-response type user authentication protocols against passive observers, and proposed a generic counting based statistical attack to recover the secret of some counting based protocols given a number of observed authentication sessions. Roughly speaking, the attack is based on the fact that secret (pass) objects appear in challenges with a different probability from non-secret (decoy) objects when the responses are taken into account. Although they mentioned that a protocol susceptible to this attack should minimize this difference, they did not give details as to how this can be achieved barring a few suggestions. In this paper, we attempt to fill this gap by generalizing the attack with a much more comprehensive theoretical analysis. Our treatment is more quantitative which enables us to describe a method to theoretically estimate a lower bound on the number of sessions a protocol can be safely used against the attack. Our results include 1) two proposed fixes to make counting protocols practically safe against the attack at the cost of usability, 2) the observation that the attack can be used on non-counting based protocols too as long as challenge generation is contrived, 3) and two main design principles for user authentication protocols which can be considered as extensions of the principles from Yan et al. This detailed theoretical treatment can be used as a guideline during the design of counting based protocols to determine their susceptibility to this attack. The Foxtail protocol, one of the protocols analyzed by Yan et al., is used as a representative to illustrate our theoretical and experimental results. © NDSS *** rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Socio-technological phishing prevention

引用

Information Security Technical Report 2011年第2期16卷 67-73页

作者： Gupta, Gaurav Pieprzyk, Josef Centre for Advanced Computing - Algorithms and Cryptography Department of Computing Macquarie University Australia

Phishing is deceptive collection of personal information leading to embezzlement, identity theft, and so on. Preventive and combative measures have been taken by banking institutions, software vendors, and network authorities to fight phishing. At the forefront of this resilience are consortiums such as APWG (Anti-Phishing Working Group) and PhishTank, the latter being a collaborative platform where everyone can submit potentially phishing web-pages and classify web-pages as either phish or genuine. PhishTank also has an API that the browsers use to notify users when she tries to load a phishing page. There are some organizations and individuals who are very active and highly accurate in classifying web-pages on PhishTank. In this paper, we propose a defense model that uses these experts to fight phishing. Categories and subject descriptors: Identity theft © 2011 Published by Elsevier Ltd.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Bucket attack on numeric set watermarking model and safeguards

引用

Information Security Technical Report 2011年第2期16卷 59-66页

作者： Gupta, Gaurav Pieprzyk, Josef Hamey, Len Centre for Advanced Computing - Algorithms and Cryptography Department of Computing Macquarie University Australia Department of Computing Macquarie University Australia

Numeric set watermarking is a way to provide ownership proof for numerical data. Numerical data can be considered to be primitives for multimedia types such as images and videos since they are organized forms of numeric information. Thereby, the capability to watermark numerical data directly implies the capability to watermark multimedia objects and discourage information theft on social networking sites and the Internet in general. Unfortunately, there has been very limited research done in the field of numeric set watermarking due to underlying limitations in terms of number of items in the set and LSBs in each item available for watermarking. In 2009, Gupta et al. proposed a numeric set watermarking model that embeds watermark bits in the items of the set based on a hash value of the items' most significant bits (MSBs). If an item is chosen for watermarking, a watermark bit is embedded in the least significant bits, and the replaced bit is inserted in the fractional value to provide reversibility. The authors show their scheme to be resilient against the traditional subset addition, deletion, and modification attacks as well as secondary watermarking attacks. In this paper, we present a bucket attack on this watermarking model. The attack consists of creating buckets of items with the same MSBs and determine if the items of the bucket carry watermark bits. Experimental results show that the bucket attack is very strong and destroys the entire watermark with close to 100% success rate. We examine the inherent weaknesses in the watermarking model of Gupta et al. that leave it vulnerable to the bucket attack and propose potential safeguards that can provide resilience against this attack. Categories and subject descriptors: [intellectual-property protection] © 2011 Published by Elsevier Ltd.

关键词： Digital watermarking

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of the LAKE hash family

Cryptanalysis of the LAKE hash family

引用

16th International Workshop on Fast Software Encryption, FSE 2009

作者： Biryukov, Alex Gauravaram, Praveen Guo, Jian Khovratovich, Dmitry Ling, San Matusiewicz, Krystian Nikolic, Ivica Pieprzyk, Josef Wang, Huaxiong University of Luxembourg Luxembourg School of Physical and Mathematical Sciences Nanyang Technological University Singapore Singapore Department of Mathematics Technical University of Denmark Denmark Centre for Advanced Computing - Algorithms and Cryptography Macquarie University Australia

ISBN: (纸本)3642033164

We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 by Aumasson, Meier and Phan. By exploiting non-injectivity of some of the building primitives of LAKE, we show three different collision and near-collision attacks on the compression function. The first attack uses differences in the chaining values and the block counter and finds collisions with complexity 233. The second attack utilizes differences in the chaining values and salt and yields collisions with complexity 242. The final attack uses differences only in the chaining values to yield near-collisions with complexity 299. All our attacks are independent of the number of rounds in the compression function. We illustrate the first two attacks by showing examples of collisions and near-collisions. © 2009 Springer Berlin Heidelberg.

关键词： Lakes

来源：评论

学校读者我要写书评

暂无评论

Reversible and blind database watermarking using difference expansion 1

Reversible and blind database watermarking using difference ...

引用

1st International Conference on Forensic Applications and Techniques in Telecommunications, Information, and Multimedia and Workshop, e-Forensics 2008

作者： Gupta, Gaurav Pieprzyk, Josef Centre for Advanced Computing - Algorithms and Cryptography Department of Computing Macquarie University SydneyNSW2109 Australia

ISBN: (纸本)9789639799196

Database watermarking has received significant research attention in the current decade. Although, almost all watermarking models have been either irreversible (the original relation cannot be restored from the watermarked relation) and/or non-blind (requiring original relation to detect the watermark in watermarked relation). This model has several disadvantages over reversible and blind watermarking (requiring only watermarked relation and secret key from which the watermark is detected and original relation is restored) including inability to identify rightful owner in case of successful secondary watermarking, inability to revert the relation to original data set (required in high precision industries) and requirement to store unmarked relation at a secure secondary storage. To overcome these problems, we propose a watermarking scheme that is reversible as well as blind. We utilize difference expansion on integers to achieve reversibility. The major advantages provided by our scheme are reversibility to high quality original data set, rightful owner identification, resistance against secondary watermarking attacks, and no need to store original database at a secure secondary storage. © 2008 ICST.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Source Code Watermarking Based on Function Dependency Oriented Sequencing

Source Code Watermarking Based on Function Dependency Orient...

引用

International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIHMSP)

作者： Gaurav Gupta Josef Pieprzyk Centre for Advanced Computing-Algorithms and Cryptography Department of Computing Macquarie University NSW Australia

In the current market, extensive software development is taking place and the software industry is thriving. Major software giants have stated source code theft as a major threat to revenues. By inserting an identity-establishing watermark in the source code, a company can prove it's ownership over the source code. In this paper, we propose a watermarking scheme for C/C++ source codes by exploiting the language restrictions. If a function calls another function, the latter needs to be defined in the code before the former, unless one uses function pre-declarations. We embed the watermark in the code by imposing an ordering on the mutually independent functions by introducing bogus dependency. Removal of dependency by the attacker to erase the watermark requires extensive manual intervention thereby making the attack infeasible. The scheme is also secure against subtractive and additive attacks. Using our watermarking scheme, an n-bit watermark can be embedded in a program having n independent functions. The scheme is implemented on several sample codes and performance changes are analyzed.

关键词： Watermarking Software Registers Additives Companies cryptography Conferences

来源：评论

学校读者我要写书评

暂无评论

Quantum optical adaptive phase estimation of sidebands

Quantum optical adaptive phase estimation of sidebands

引用

Conference on Lasers and Electro-Optics (CLEO)

作者： T.A. Wheatley E.H. Huntington D.W. Berry H.M. Wiseman T.C. Ralph School of Information Technology and Electrical Engineering University College University of New South Wales Canberra ACT Australia Department of Physics and Centre for Advanced Computing Algorithms and Cryptography Macquarie University Sydney Australia School of Science Griffith University Nathan QLD Australia Department of Physics University of Queensland Brisbane QLD Australia

We present experimental results of the use of continuous adaptive feedback in quantum optical measurement of phase of the sidebands on continuous-wave (cw) coherent light, consistent with theoretical predictions (Berr... 详细信息

ISBN: (纸本)9781557528599

关键词： Adaptive optics Phase estimation Phase detection Optical feedback Phase measurement Optical noise Optical mixing Quantum computing Pollution measurement Phase noise

来源：评论

学校读者我要写书评

暂无评论

Quantum optical adaptive phase estimation of sidebands

Optics InfoBase Conference Papers

引用

Optics InfoBase Conference Papers 2008年

作者： Wheatley, T.A. Huntington, E.H. Berry, D.W. Wiseman, H.M. Ralph, T.C. School of Information Technology and Electrical Engineering University College The University of New South Wales Canberra 2600 ACT Australia Department of Physics Centre for Advanced Computing Algorithms and Cryptography Macquarie University Sydney 2109 NSW Australia School of Science Griffith University Nathan 4111 QLD Australia Department of Physics University of Queensland Brisbane 4072 QLD Australia

ISBN: (纸本)9781557528599

关键词： Optical data processing

来源：评论

学校读者我要写书评

暂无评论

Software watermarking Resilient to debugging attacks

引用

Journal of Multimedia 2007年第2期2卷 10-16页

作者： Gupta, Gaurav Pieprzyk, Josef Centre for Advanced Computing - Algorithms and Cryptography Department of Computing Division of Information and Communication Sciences Macquarie University Sydney NSW - 2109 Australia

In 2006, Gaurav Gupta and Josef Pieprzyk presented an attack on the branch-based software watermarking scheme proposed by Ginger Myles and Hongxia Jin in 2005. The software watermarking model is based on replacing jump instructions or unconditional branch statements (UBS) by calls to a fingerprint branch function (FBF) that computes the correct target address of the UBS as a function of the generated fingerprint and integrity check. If the program is tampered with, the fingerprint and/or integrity checks change and the target address is not computed correctly. Gupta and Pieprzyk's attack uses debugger capabilities such as register and address lookup and breakpoints to minimize the requirement to manually inspect the software. Using these resources, the FBF and calls to the same is identified, correct displacement values are generated and calls to FBF are replaced by the original UBS transferring controlof the attack to the correct target instruction. In this paper, we propose a watermarking model that provides security against such debugging attacks. Two primary measures taken are shifting the stack pointer modification operation from the FBF to the individual UBSs, and coding the stack pointer modification in the same language as that of the rest of the code rather than assembly language to avoid conspicuous contents. The manual component complexity increases from O(1) in the previous scheme to O(n) in our proposed scheme. © 2007 ACADEMY PUBLISHER.

关键词： Program debugging

来源：评论

学校读者我要写书评

暂无评论

An attack-localizing watermarking scheme for natural language documents 06

An attack-localizing watermarking scheme for natural languag...

引用

2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06

作者： Gupta, Gaurav Pieprzyk, Josef Wang, Hua Xiong Centre for Advanced Computing - Algorithms and Cryptography Department of Computing Macquarie University Sydney NSW 2109 Australia

ISBN: (纸本)1595932720

We present a text watermarking scheme that embeds a bit-stream watermark Wi in a text document P preserving the meaning, context, and flow of the document. The document is viewed as a set of paragraphs, each paragraph being a set of sentences. The sequence of paragraphs and sentences used to embed watermark bits is permuted using a secret key. Then, English language sentence transformations are used to modify sentence lengths, thus embedding watermarking bits in the Least Significant Bits (LSB) of the sentences' cardinalities. The embedding and extracting algorithms are public, while the secrecy and security of the watermark depends on a secret key K. The probability of False Positives is extremely small, hence avoiding incidental occurrences of our watermark in random text documents. Majority voting provides security against text addition, deletion, and swapping attacks, further reducing the probability of False Positives. The scheme is secure against the general attacks on text watermarks such as reproduction (photocopying, FAX), reformatting, synonym substitution, text addition, text deletion, text swapping, paragraph shuffling and collusion attacks. Copyright 2006 ACM.

关键词： Digital watermarking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：