Relation Between Quantum Advantage in Supervised Learning and Quantum Computational Advantage by Jordi Perez-Guijarro, Alba Pages-Zamora, Javier R. Fonollosa

“…The widespread use of machine learning has raised the question of quantum supremacy for supervised learning as compared to quantum computational advantage. In fact, a recent work shows that computational and learning advantages are, in general, not equivalent, i.e., the additional information provided by a training set can reduce the hardness of some problems. …”
Get full text

Advantages of Logarithmic Signatures in the Implementation of Crypto Primitives by Yevhen Kotukh, Hennadii Khalimov

“… Computationally complex tasks, or "hard problems" for brevity, is a broad term that encompasses problems that require a significant number of resources to solve. …”
Get full text

Parallelizing Quantum Simulation With Decision Diagrams by Shaowen Li, Yusuke Kimura, Hiroyuki Sato, Masahiro Fujita

“…Since people became aware of the power of quantum phenomena in the domain of traditional computation, a great number of complex problems that were once considered intractable in the classical world have been tackled. …”
Get full text

Triple receiver public key encryption cryptosystem by Liutao ZHAO, Lin ZHONG, Jidong LIU, Caiqun WANG, Dan WU

“…A triple receiver public key cryptosystem was proposed.In the cryptosystem,a sender encrypted a message and sent to three receivers,while the three receivers were able to decrypt the message with their own private keys.Based on bilinear map,two triple receiver public key encryption schemes with different security were constructed.If the gap bilinear Diffie-Hellman (GBDH) problem and the computational Diffie-Hellman (CDH) problem were proved formally to be intractable,then the two schemes proposed were semantically secure against chosen-plaintext attacks and against adaptive chosen ciphertext attacks respectively.The proposed scheme only added an exponential operation and a hash operation,and constructed three independent receivers which had a high efficiency.Analyses show that proposed scheme can improve the security of TLS protocol and apply to hierarchical public key cryptosystems.…”
Get full text

An Efficient Two-Objective Hybrid Local Search Algorithm for Solving the Fuel Consumption Vehicle Routing Problem by Weizhen Rao, Feng Liu, Shengbin Wang

“…To tackle the FCVRP’s computational intractability, we propose an efficient two-objective hybrid local search algorithm (TOHLS). …”
Get full text

An Efficient Algorithm to Find Broadcast Schedule in Ad Hoc TDMA Networks by Imtiaz Ahmad, Buthaina Al-Kazemi, A. Shoba Das

Get full text

Certificateless generalized signcryption scheme in the standard model by Shu-fen NIU, Ling NIU, Cai-fen WANG, Ya-hong LI

“…In 2010,Liu,et al.proposed a certificateless signcryption scheme in the standard model,but many analyses revealed that Liu's scheme was insecure in fact.To overcome the disadvantages,the scheme was improved and a certificateless generalized signcryption scheme was constructed.In addition,a formal security model for the proposed scheme against the malicious-but-passive KGC attacks was introduced.Furthermore,the proposed scheme was proven to be secure under the decisional bilinear Diffie-Hellman and the computational Diffie-Hellman intractability assumptions in the standard model.Numerical results illustrate that the proposed algorithm is efficient.…”
Get full text

Track-to-Track Association Based on Structural Similarity in the Presence of Sensor Biases by Hongyan Zhu, Suying Han

“…In some challenging scenarios, it may be infeasible to implement bias estimation and compensation in time due to the computational intractability or weak observability about sensor biases. …”
Get full text

Efficient anonymous password-based authenticated key exchange scheme by TAN Shi-chong, PANG Liao-jun, SU Wan-li, WANG Yu-min

“…,the key was used for data confidentiality and/or integrity）.There has been much interest in password-authenticated key exchange protocol which remains secure even when users choose passwords from a small space of possible passwords,such as a dictionary of English words.A password-based authenticated key exchange scheme was proposed.The analysis shows that the scheme is secure against dictionary attack under the computational Diffie-Hellman intractability assumption,and preserves user privacy and achieves unlinkability.Furthermore,since denial-of-service（DoS） attacks have become a common threat,DoS-resistantance is a design consid-eration and the scheme is proved to be secure against denial-of-service attacks.…”
Get full text

Achieving Fair Spectrum Allocation and Reduced Spectrum Handoff in Wireless Sensor Networks: Modeling via Biobjective Optimization by Sang-Seon Byun, Kimmo Kansanen, Ilangko Balasingham, Joon-Min Gil

Get full text

Deep Q-Networks for Minimizing Total Tardiness on a Single Machine by Kuan Wei Huang, Bertrand M. T. Lin

“…This paper considers the single-machine scheduling problem of total tardiness minimization. Due to its computational intractability, exact approaches such as dynamic programming algorithms and branch-and-bound algorithms struggle to produce optimal solutions for large-scale instances in a reasonable time. …”
Get full text

Geographical Peer Matching for P2P Energy Sharing by Romaric Duvignau, Vincenzo Gulisano, Marina Papatriantafilou, Ralf Klasing

“…We define and analyze in this work a precise mathematical modeling of the geographical peer matching problem, and demonstrate the inherent intractability of the problem, highlighting its high computational cost and underscoring the critical need for scalable approaches that effectively balance performance trade-offs as system size grows. …”
Get full text

Verifiable measurement-based quantum random sampling with trapped ions by Martin Ringbauer, Marcel Hinsche, Thomas Feldker, Paul K. Faehrmann, Juani Bermejo-Vega, Claire L. Edmunds, Lukas Postler, Roman Stricker, Christian D. Marciniak, Michael Meth, Ivan Pogorelov, Rainer Blatt, Philipp Schindler, Jens Eisert, Thomas Monz, Dominik Hangleiter

“…One way to demonstrate the advantage of quantum computation is through quantum random sampling performed on quantum computing devices. …”
Get full text

Collusion-Tolerable and Efficient Privacy-Preserving Time-Series Data Aggregation Protocol by Yongkai Li, Shubo Liu, Jun Wang, Mengjun Liu

“…We formally analyzed the security of our protocol and results showed that the protocol is secure if the Computational Diffie-Hellman (CDH) problem is intractable. …”
Get full text

Implementation of Membrane Algorithms on GPU by Xingyi Zhang, Bangju Wang, Zhuanlian Ding, Jin Tang, Juanjuan He

“…Membrane algorithms are a new class of parallel algorithms, which attempt to incorporate some components of membrane computing models for designing efficient optimization algorithms, such as the structure of the models and the way of communication between cells. …”
Get full text

Modelling and Metaheuristic for Gantry Crane Scheduling and Storage Space Allocation Problem in Railway Container Terminals by Ming Zeng, Wenming Cheng, Peng Guo

“…A metaheuristic named backtracking search algorithm (BSA) is then improved to solve this intractable problem. A series of computational experiments are carried out to evaluate the performance of the proposed algorithm under some randomly generated cases based on the practical operation conditions. …”
Get full text

ID-based signature without trusted PKG by ZHOU Liang1, LI Da-peng2, YANG Yi-xian1

“…PKG（private key generater） scheme was presented to overcome Chen-Zhang-Kim’s scheme drawback about a large amount of computation and Gorantla-Saxena’s scheme drawback about needing trusted PKG.More precisely,under the random oracle model,the scheme is proved to be secure against existential forgery on adaptively chosen message and ID attack,assuming CDHP is intractable.The scheme not only is traceable that the arbiter can use Trace algorithm to de-tect deceiver but also eliminates the inherent key escrow problem.As compared with the typical signatures schemes to date,the proposed scheme achieves the higher efficiency.…”
Get full text

Precision Security: Integrating Video Surveillance with Surrounding Environment Changes by Wenfeng Wang, Xi Chen, Guiwei Zhang, Jing Qian, Peng Wei, Boqian Wu, Hongwei Zheng

“…Video surveillance plays a vital role in maintaining the social security although, until now, large uncertainty still exists in danger understanding and recognition, which can be partly attributed to intractable environment changes in the backgrounds. …”
Get full text

PARALLEL ALGORITHMS OF RANDOM FORESTS FOR CLASSIFYING VERY LARGE DATASETS by Do Thanh Nghi, Pham Nguyen Khang, Nguyen Van Hoa, Ly Hoang Trong

“…The learning and classification tasks of a set of decision trees take a lot of time, make it intractable when dealing with very large datasets. There is a need to scale up the random forests algorithm to handle massive datasets. …”
Get full text

Protect or prevent? A practicable framework for the dilemmas of COVID-19 vaccine prioritization. by Raghu Arghal, Harvey Rubin, Shirin Saeedi Bidokhti, Saswati Sarkar

“…Answering such questions often becomes computationally intractable given that network size can exceed millions. …”
Get full text