Výsledky vyhľadávania - CCS Concepts: Theory of computation → Computational complexity AND cryptography*

Kolmogorov time hierarchy and novelty games ; Hiérarchie temporelle de Kolmogorov et jeux de trouvailles

Autori: Léchine, Ulysse Seiller, Thomas Laboratoire d'Informatique de Paris-Nord (LIPN) a ďalší

Prispievatelia: Léchine, Ulysse Seiller, Thomas Laboratoire d'Informatique de Paris-Nord (LIPN) a ďalší

Zdroj: https://hal.science/hal-04539439 ; 2025.

Predmety: CCS Concepts: Theory of computation → Computational complexity and cryptography, Theory of computation → Computational complexity and cryptography, CCS Concepts, Combinatorial game, Time hierarchy, Mathematics of computing → Discrete mathematics Kolmogorov Complexity, Combinatorics, Parallel computing, time bounded kolmogorov complexity, Complexity theory, Kolmogorov Complexity, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO]Computer Science [cs], [MATH]Mathematics [math], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

Dostupnosť: https://hal.science/hal-04539439
https://hal.science/hal-04539439v3/document
https://hal.science/hal-04539439v3/file/main.pdf

Kolmogorov time hierarchy and novelty games ; Hiérarchie temporelle de Kolmogorov et jeux de trouvailles

Autori: Léchine, Ulysse Seiller, Thomas Laboratoire d'Informatique de Paris-Nord (LIPN) a ďalší

Prispievatelia: Léchine, Ulysse Seiller, Thomas Laboratoire d'Informatique de Paris-Nord (LIPN) a ďalší

Zdroj: https://hal.science/hal-04539439 ; 2024.

Predmety: Kolmogorov Complexity, Complexity theory, time bounded kolmogorov complexity, Parallel computing, Combinatorics, CCS Concepts: Theory of computation → Computational complexity and cryptography, Mathematics of computing → Discrete mathematics Kolmogorov Complexity, Time hierarchy, Combinatorial game, CCS Concepts, Theory of computation → Computational complexity and cryptography, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO]Computer Science [cs], [MATH]Mathematics [math], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

Dostupnosť: https://hal.science/hal-04539439
https://hal.science/hal-04539439v2/document
https://hal.science/hal-04539439v2/file/Kolmogorov-v2.pdf

"Intelligent Heuristics Are the Future of Computing".

Autori: Teng, Shang-Hua

Zdroj: ACM Transactions on Intelligent Systems & Technology; Dec2023, Vol. 14 Issue 6, p1-39, 39p

Predmety: HEURISTIC, SIMPLEX algorithm, COMPUTER software, EVOLUTIONARY algorithms, COMPUTER science, UBIQUITOUS computing

Expected Constant Round Byzantine Broadcast under Dishonest Majority.

Autori: Wan, Jun Xiao, Hanshen Shi, Elaine a ďalší

Zdroj: Journal of the ACM; Aug2025, Vol. 72 Issue 4, p1-39, 39p

Predmety: DISTRIBUTED computing, DISTRIBUTED algorithms, COMPUTATIONAL complexity, DISTRIBUTED network protocols, CRYPTOGRAPHY

A Survey of Nature-Inspired Computing: Membrane Computing.

Autori: BOSHENG SONG KENLI LI ORELLANA-MARTÍN, DAVID a ďalší

Zdroj: ACM Computing Surveys; Jan2022, Vol. 54 Issue 1, p1-31, 31p

Predmety: COMPUTATIONAL complexity, NP-complete problems, RECURSION theory, CELL anatomy, COMPUTER systems, BIOLOGICALLY inspired computing

Efficient provable dual receiver hybrid and light weight public key schemes based on the discrete logarithm problem without pairings.

Autori: Abouelkheir, Eman

Zdroj: IET Communications (Wiley-Blackwell); Dec2024, Vol. 18 Issue 19, p1417-1427, 11p

Predmety: TELECOMMUNICATION security, COMPUTER network security, INTERNET of things, COMPUTATIONAL complexity, CLOUD computing

Efficient Cryptographic Solutions for Unbalanced Private Set Intersection in Mobile Communication.

Autori: Feng, Qian Du, Shenglong Tan, Wuzheng a ďalší

Zdroj: Information; Sep2024, Vol. 15 Issue 9, p554, 31p

Predmety: INTERNET of things, WIRELESS Internet, COMPUTATIONAL complexity, CUCKOOS

The Parameterized Complexity of the k-Biclique Problem.

Autori: Lin, Bingkai

Zdroj: Journal of the ACM; Sep2018, Vol. 65 Issue 5, p1-23, 23p

Predmety: BIPARTITE graphs, COMPUTATIONAL complexity, PATHS & cycles in graph theory, SUBGRAPHS, COMPLETE graphs, ALGORITHMS

An Efficient 2-Party Private Function Evaluation Protocol Based on Half Gates.

Autori: Bingöl, Muhammed Ali Biçer, Osman Kiraz, Mehmet Sabir a ďalší

Zdroj: Computer Journal; Apr2019, Vol. 62 Issue 4, p598-613, 16p

Predmety: CRYPTOGRAPHY, COMPUTATIONAL complexity, COMMUNICATION complexity (Information theory), ALGORITHMS, PERMUTATIONS

Efficient face information encryption and verification scheme based on full homomorphic encryption.

Autori: Chen, Yijia Duan, Fei Zhao, Yuhui a ďalší

Zdroj: Scientific Reports; 4/3/2025, Vol. 15 Issue 1, p1-15, 15p

Mechanized Proofs of Adversarial Complexity and Application to Universal Composability.

Autori: BARBOSA, MANUEL BARTHE, GILLES GRÉGOIRE, BENJAMIN a ďalší

Zdroj: ACM Transactions on Privacy & Security; Aug2023, Vol. 26 Issue 3, p1-34, 34p

Predmety: CRYPTOGRAPHY, MACHINE learning, ARTIFICIAL intelligence, ARTIFICIAL neural networks, COMPUTER access control

Image encryption algorithm based on factorial decomposition.

Autori: AlShaikh, Muath Alzaqebah, Malek Gmati, Nabil a ďalší

Zdroj: Multimedia Tools & Applications; Dec2024, Vol. 83 Issue 40, p88447-88467, 21p

Predmety: MATHEMATICAL decomposition, COMPUTATIONAL complexity, STATISTICS, PERMUTATIONS, SENSITIVITY analysis, IMAGE encryption

New Constructions of Existential Unforgeable Aggregate Signature Scheme from CSP.

Autori: Mi, Bo Zou, Yongxing Huang, Darong a ďalší

Zdroj: Security & Communication Networks; 11/9/2022, p1-13, 13p

Predmety: PUBLIC key cryptography, RSA algorithm, DIGITAL signatures, PRIME numbers, PUBLIC safety, COMPUTATIONAL complexity

Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs.

Autori: Baillot, Patrick Barthe, Gilles Dal Lago, Ugo

Zdroj: Journal of Automated Reasoning; Dec2019, Vol. 63 Issue 4, p813-855, 43p

Predmety: CRYPTOGRAPHY, MACHINE theory, ALGORITHMS, MATHEMATICAL variables, ITERATIVE methods (Mathematics)

An Applied Image Cryptosystem on Moore's Automaton Operating on γ(qk)/F2.

Autori: DEB, SUBHRAJYOTI DAS, ABHILASH KAR, NIRMALYA

Zdroj: ACM Transactions on Multimedia Computing, Communications & Applications; Feb2024, Vol. 20 Issue 2, p1-20, 20p

Predmety: IMAGE encryption, ROBOTS, CYCLIC groups, FINITE fields, RANDOM numbers, COMPUTATIONAL complexity

Modeling an efficient authentic provable data possession model using legacy filter model for IOT and cloud environment.

Autori: Nagesh, Puvvada Srinivasu, N.

Zdroj: Information Security Journal: A Global Perspective; 2023, Vol. 32 Issue 6, p430-443, 14p

Predmety: INTERNET of things, TIME complexity, DATA modeling, COMPUTATIONAL complexity, DATA integrity, CLOUD computing

Developing non-interactive MPC with trusted hardware for enhanced security.

Autori: Karl, Ryan Burchfield, Hannah Takeshita, Jonathan a ďalší

Zdroj: International Journal of Information Security; Aug2022, Vol. 21 Issue 4, p777-797, 21p

Predmety: TRUST, SECURITY management, HARDWARE, PROBLEM solving, COMPUTATIONAL complexity, FAIRNESS

Secure Multiparty Computations on Bitcoin.

Autori: Andrychowicz, Marcin Dziembowski, Stefan Malinowski, Daniel a ďalší

Zdroj: Communications of the ACM; Apr2016, Vol. 59 Issue 4, p76-84, 9p, 2 Diagrams

Predmety: LOTTERIES, BITCOIN, MULTIPLE comparisons (Statistics), COMPUTATIONAL complexity, FAIRNESS, MANAGEMENT

Towards a security model for computational puzzle schemes.

Autori: Tang, Qiang Jeckmans, Arjan

Zdroj: International Journal of Computer Mathematics; Jul2011, Vol. 88 Issue 11, p2246-2257, 12p

Predmety: COMPUTER security, MODELS & modelmaking, CRYPTOGRAPHY, SPAM email, DENIAL of service attacks, PARALLEL computers, COMPUTATIONAL complexity

A Fully Authenticated Diffie-Hellman Protocol and Its Application in WSNs.

Autori: Sun, Fajun He, Selena Zhang, Xiaotong a ďalší

Zdroj: IEEE Transactions on Information Forensics & Security; 2022, Vol. 17, p1986-1999, 14p