Cybersecurity and Cyberforensics Conference最新文献

筛选
英文 中文
Generalized Quantum Arthur-Merlin Games 广义量子亚瑟-梅林游戏
Cybersecurity and Cyberforensics Conference Pub Date : 2013-12-16 DOI: 10.4230/LIPIcs.CCC.2015.488
Hirotada Kobayashi, F. Gall, H. Nishimura
{"title":"Generalized Quantum Arthur-Merlin Games","authors":"Hirotada Kobayashi, F. Gall, H. Nishimura","doi":"10.4230/LIPIcs.CCC.2015.488","DOIUrl":"https://doi.org/10.4230/LIPIcs.CCC.2015.488","url":null,"abstract":"This paper investigates the role of interaction and coins in quantum Arthur-Merlin games(also called public-coin quantum interactive proof systems). While the existing model restricts the messages from the verifier to be classical even in the quantum setting, the present work introduces a generalized version of quantum Arthur-Merlin games where the messages from the verifier can be quantum as well: the verifier can send not only random bits, but also halves of EPR pairs. This generalization turns out to provide several novel characterizations of quantum interactive proof systems with a constant number of turns. First, it is proved that the complexity class corresponding to two-turn quantum Arthur-Merlin games where both of the two messages are quantum, denoted qq-QAM in this paper, does not change by adding a constant number of turns of classical interaction prior to the communications of qq-QAM proof systems. This can be viewed as a quantum analogue of the celebrated collapse theorem for AM due to Babai. To prove this collapse theorem, this paper presents a natural complete problem for qq-QAM: deciding whether the output of a given quantum circuit is close to a totally mixed state. This complete problem is on the very line of the previous studies investigating the hardness of checking properties related to quantum circuits, and thus, qq-QAM may provide a good measure in computational complexity theory. It is further proved that the class qq-QAM1, the perfect-completeness variant of qq-QAM, gives new bounds for standard well-studied classes of two-turn quantum interactive proof systems. Finally, the collapse theorem above is extended to comprehensively classify the role of classical and quantum interactions in quantum Arthur-Merlin games: it is proved that, for any constant m ≥ 2, the class of problems having m-turn quantum Arthur-Merlin proof systems is either equal to PSPACE or equal to the class of problems having two-turn quantum Arthur-Merlin proof systems of a specific type, which provides a complete set of quantum analogues of Babai's collapse theorem.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126742813","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Constrained distributed model predictive control strategy based on agent coordination 基于智能体协调的约束分布式模型预测控制策略
Cybersecurity and Cyberforensics Conference Pub Date : 2012-07-25 DOI: 10.1109/CHICC.2014.6896292
Danxuan Yang, Mengling Wang, H. Shi
{"title":"Constrained distributed model predictive control strategy based on agent coordination","authors":"Danxuan Yang, Mengling Wang, H. Shi","doi":"10.1109/CHICC.2014.6896292","DOIUrl":"https://doi.org/10.1109/CHICC.2014.6896292","url":null,"abstract":"In this paper, a distributed model predictive control (DMPC) strategy is proposed based on agent coordination, in which subsystems couple through the inputs. At first, the initial feasible solution of each agent can be achieved by solving local optimization problems in which the state constraints of neighbor subsystems are considered at each sampling time. And then the global optimal solution can be obtained through agent coordination. In the negotiating process, the innovative global optimization objective is determined for the sake of reducing iteration time and improving the convergence speed efficiently. Finally, the accuracy and efficiency of the proposed scheme is put to test through simulation.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114246871","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Parallel Approximation of Min-max Problems with Applications to Classical and Quantum Zero-Sum Games 最小-最大问题的并行逼近及其在经典和量子零和博弈中的应用
Cybersecurity and Cyberforensics Conference Pub Date : 2010-11-11 DOI: 10.1109/CCC.2012.12
Gus Gutoski, Xiaodi Wu
{"title":"Parallel Approximation of Min-max Problems with Applications to Classical and Quantum Zero-Sum Games","authors":"Gus Gutoski, Xiaodi Wu","doi":"10.1109/CCC.2012.12","DOIUrl":"https://doi.org/10.1109/CCC.2012.12","url":null,"abstract":"This paper presents an efficient parallel algorithm for a new class of min-max problems based on the matrix multiplicative weights update method. Our algorithm can be used to find near-optimal strategies for competitive two-player classical or quantum games in which a referee exchanges any number of messages with one player followed by any number of additional messages with the other. This algorithm considerably extends the class of games which admit parallel solutions, demonstrating for the first time the existence of a parallel algorithm for a game in which one player reacts adaptively to the other. As a consequence, we prove that several competing-provers complexity classes collapse to PSPACE such as QRG(2), SQG and two new classes called DIP and DQIP. A special case of our result is a parallel approximation scheme for a new class of semi definite programs whose feasible region consists of lists of semi definite matrices that satisfy a ``transcript-like'' consistency condition. Applied to this special case, our algorithm yields a direct polynomial-space simulation of multi-message quantum interactive proofs resulting in a first-principles proof of QIP=PSPACE.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128246976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
Limits on the Hardness of Lattice Problems in ell _p Norms ell - p范数格问题的硬度极限
Cybersecurity and Cyberforensics Conference Pub Date : 2007-06-13 DOI: 10.1109/CCC.2007.12
Chris Peikert
{"title":"Limits on the Hardness of Lattice Problems in ell _p Norms","authors":"Chris Peikert","doi":"10.1109/CCC.2007.12","DOIUrl":"https://doi.org/10.1109/CCC.2007.12","url":null,"abstract":"We show that several recent \"positive\" results for lattice problems in the l2 norm also hold in lp norms, for p>2. In particular, for lattices of dimension n: (i) approximating the shortest and closest vector in the lp norm to within O macr(radicn) factors is contained in coNP, (ii) approximating the length of the shortest vector in the lp norm to within O breve(n) factors reduces to the average-case problems studied in related works (Ajtai, STOC 1996; Micciancio and Regev, FOCS 2004; Regev, STOC 2005). These results improve upon prior understanding of lp norms by up to radicn factors. Taken together, they can be viewed as a partial converse to recent reductions from the l2 norm to lp norms (Regev and Rosen, STOC 2006). One of our main technical contributions is a very general analysis of Gaussian distributions over lattices, which may be of independent interest. Our proofs employ analytical techniques of Banaszczyk which, to our knowledge, have yet to be exploited in computer science.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127456491","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 36
Analysis and Design of Oscillator Networks 振荡器网络的分析与设计
Cybersecurity and Cyberforensics Conference Pub Date : 2006-08-01 DOI: 10.1109/CHICC.2006.280941
U. Jönsson
{"title":"Analysis and Design of Oscillator Networks","authors":"U. Jönsson","doi":"10.1109/CHICC.2006.280941","DOIUrl":"https://doi.org/10.1109/CHICC.2006.280941","url":null,"abstract":"The design and analysis of oscillator networks raises a number of fundamental questions in systems and control. The existence, uniqueness, and location of periodic solutions of dynamical systems as well as the stability and robustness of these solutions are all challenging problems that must be addressed in design and analysis of such networks. In this paper, we investigate local stability and robustness properties of oscillator networks. The focus is on how the design of the network interconnection matrix affects both convergence and robustness of the network.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121788220","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Solvable Group Isomorphism 可解群同构
Cybersecurity and Cyberforensics Conference Pub Date : 2004-06-21 DOI: 10.1109/CCC.2004.1313808
V. Arvind, J. Torán
{"title":"Solvable Group Isomorphism","authors":"V. Arvind, J. Torán","doi":"10.1109/CCC.2004.1313808","DOIUrl":"https://doi.org/10.1109/CCC.2004.1313808","url":null,"abstract":"The group isomorphism problem consists in deciding whether two input groups G/sup 1/ and G/sup 2/ given by their multiplication tables are isomorphic. We first give a 2-round Arthur-Merlin protocol for the group non-isomorphism problem such that on input groups (G/sup 1/, G/sup 2/) of size n, Arthur uses O(log/sup 6/ n) random bits and Merlin uses O(log/sup 2/ n) nondeterministic bits. We derandomize this protocol for the case of solvable groups showing the following two results: (a) We give a uniform NP machine for solvable group non-isomorphism, that works correctly on all but 2/sup polylog(n)/ inputs of any length n. Furthermore, this NP machine is always correct when the input groups are nonisomorphic. The NP machine is obtained by an unconditional derandomization of the AM protocol. (b) Under the assumption that EXP /spl nsube/ i.o.PSPACE we get a complete derandomization of the above AM protocol. Thus, EXP /spl nsube/ i.o.PSPACE implies that group isomorphism for solvable groups is in NP /spl cap/ coNP.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131798824","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
New Sampling Lower Bounds via the Separator 新的采样下限通过分隔符
Cybersecurity and Cyberforensics Conference Pub Date : 1900-01-01 DOI: 10.4230/LIPIcs.CCC.2023.26
Emanuele Viola
{"title":"New Sampling Lower Bounds via the Separator","authors":"Emanuele Viola","doi":"10.4230/LIPIcs.CCC.2023.26","DOIUrl":"https://doi.org/10.4230/LIPIcs.CCC.2023.26","url":null,"abstract":"Suppose that a target distribution can be approximately sampled by a low-depth decision tree, or more generally by an efficient cell-probe algorithm. It is shown to be possible to restrict the input to the sampler so that its output distribution is still not too far from the target distribution","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123455070","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Easiness Amplification and Uniform Circuit Lower Bounds 放大和均匀电路下界
Cybersecurity and Cyberforensics Conference Pub Date : 1900-01-01 DOI: 10.4230/LIPIcs.CCC.2017.8
Cody Murray, Richard Ryan Williams
{"title":"Easiness Amplification and Uniform Circuit Lower Bounds","authors":"Cody Murray, Richard Ryan Williams","doi":"10.4230/LIPIcs.CCC.2017.8","DOIUrl":"https://doi.org/10.4230/LIPIcs.CCC.2017.8","url":null,"abstract":"We present new consequences of the assumption that time-bounded algorithms can be \"compressed\" with non-uniform circuits. Our main contribution is an \"easiness amplification\" lemma for circuits. One instantiation of the lemma says: if n^{1+e}-time, tilde{O}(n)-space computations have n^{1+o(1)} size (non-uniform) circuits for some e > 0, then every problem solvable in polynomial time and tilde{O}(n) space has n^{1+o(1)} size (non-uniform) circuits as well. This amplification has several consequences: \u0000 \u0000* An easy problem without small LOGSPACE-uniform circuits. For all e > 0, we give a natural decision problem, General Circuit n^e-Composition, that is solvable in about n^{1+e} time, but we prove that polynomial-time and logarithmic-space preprocessing cannot produce n^{1+o(1)}-size circuits for the problem. This shows that there are problems solvable in n^{1+e} time which are not in LOGSPACE-uniform n^{1+o(1)} size, the first result of its kind. We show that our lower bound is non-relativizing, by exhibiting an oracle relative to which the result is false. \u0000 \u0000* Problems without low-depth LOGSPACE-uniform circuits. For all e > 0, 1 < d < 2, and e < d we give another natural circuit composition problem computable in tilde{O}(n^{1+e}) time, or in O((log n)^d) space (though not necessarily simultaneously) that we prove does not have SPACE[(log n)^e]-uniform circuits of tilde{O}(n) size and O((log n)^e) depth. We also show SAT does not have circuits of tilde{O}(n) size and log^{2-o(1)}(n) depth that can be constructed in log^{2-o(1)}(n) space. \u0000 \u0000* A strong circuit complexity amplification. For every e > 0, we give a natural circuit composition problem and show that if it has tilde{O}(n)-size circuits (uniform or not), then every problem solvable in 2^{O(n)} time and 2^{O(sqrt{n log n})} space (simultaneously) has 2^{O(sqrt{n log n})}-size circuits (uniform or not). We also show the same consequence holds assuming SAT has tilde{O}(n)-size circuits. As a corollary, if n^{1.1} time computations (or O(n) nondeterministic time computations) have tilde{O}(n)-size circuits, then all problems in exponential time and subexponential space (such as quantified Boolean formulas) have significantly subexponential-size circuits. This is a new connection between the relative circuit complexities of easy and hard problems.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124794518","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On the Average-Case Complexity of MCSP and Its Variants MCSP及其变体的平均情况复杂度
Cybersecurity and Cyberforensics Conference Pub Date : 1900-01-01 DOI: 10.4230/LIPIcs.CCC.2017.7
Shuichi Hirahara, R. Santhanam
{"title":"On the Average-Case Complexity of MCSP and Its Variants","authors":"Shuichi Hirahara, R. Santhanam","doi":"10.4230/LIPIcs.CCC.2017.7","DOIUrl":"https://doi.org/10.4230/LIPIcs.CCC.2017.7","url":null,"abstract":"We prove various results on the complexity of MCSP (Minimum Circuit Size Problem) and the related MKTP (Minimum Kolmogorov Time-Bounded Complexity Problem): \u0000 \u0000* We observe that under standard cryptographic assumptions, MCSP has a pseudorandom self-reduction. This is a new notion we define by relaxing the notion of a random self-reduction to allow queries to be pseudorandom rather than uniformly random. As a consequence we derive a weak form of a worst-case to average-case reduction for (a promise version of) MCSP. Our result also distinguishes MCSP from natural NP-complete problems, which are not known to have worst-case to average-case reductions. Indeed, it is known that strong forms of worst-case to average-case reductions for NP-complete problems collapse the Polynomial Hierarchy. \u0000 \u0000* We prove the first non-trivial formula size lower bounds for MCSP by showing that MCSP requires nearly quadratic-size De Morgan formulas. \u0000 \u0000* We show average-case superpolynomial size lower bounds for MKTP against AC0[p] for any prime p. \u0000 \u0000* We show the hardness of MKTP on average under assumptions that have been used in much recent work, such as Feige's assumptions, Alekhnovich's assumption and the Planted Clique conjecture. In addition, MCSP is hard under Alekhnovich's assumption. Using a version of Feige's assumption against co-nondeterministic algorithms that has been conjectured recently, we provide evidence for the first time that MKTP is not in coNP. Our results suggest that it might worthwhile to focus on the average-case hardness of MKTP and MCSP when approaching the question of whether these problems are NP-hard.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125770494","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 52
PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster PPSZ通用k-SAT -使Hertli的分析更简单,3-SAT更快
Cybersecurity and Cyberforensics Conference Pub Date : 1900-01-01 DOI: 10.4230/LIPIcs.CCC.2017.9
Dominik Scheder, J. Steinberger
{"title":"PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster","authors":"Dominik Scheder, J. Steinberger","doi":"10.4230/LIPIcs.CCC.2017.9","DOIUrl":"https://doi.org/10.4230/LIPIcs.CCC.2017.9","url":null,"abstract":"The currently fastest known algorithm for k-SAT is PPSZ named after its inventors Paturi, Pudlak, Saks, and Zane. Analyzing its running time is much easier for input formulas with a unique satisfying assignment. In this paper, we achieve three goals. First, we simplify Hertli's analysis for input formulas with multiple satisfying assignments. Second, we show a \"translation result\": if you improve PPSZ for k-CNF formulas with a unique satisfying assignment, you will immediately get a (weaker) improvement for general k-CNF formulas. Combining this with a result by Hertli from 2014, in which he gives an algorithm for Unique-3-SAT slightly beating PPSZ, we obtain an algorithm beating PPSZ for general 3-SAT, thus obtaining the so far best known worst-case bounds for 3-SAT.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131379759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信