Reviewerly/exHarmony huggingface dataset:
Indifferentiability of the Confusion-Diffusion Network and the Cascade Block Cipher

Substitution Permutation Networks (SPNs) are widely used in the design of modern symmetric cryptographic building blocks. In their Eurocrypt 2016 paper titled 'Indifferentiability of Confusion-Diffusion Networks', Dodis et al. theorized such SPNs as Confusion-Diffusion networks and established their provable security in Maurer's indifferentiability framework. Guo et al. extended this work to non-linear Confusion-Diffusion networks (NLCDNs), i.e., networks using non-linear permutation layers, in weaker indifferentiability settings. The authors provided a security proof in the sequential indifferentiability model for the 3-round NLCDN and exhibited the tightness of the positive result by providing an (incorrect) attack on the 2-round NLCDN. In this paper, we provide a corrected attack on the 2-round NLCDN. Our attack on the 2-round CDN is primitive-construction-sequential, implying that the construction is not secure even in the weaker sequential indifferentiability setting of Mandal et al. In their paper titled 'Revisiting Cascade Ciphers in Indifferentiability Setting', Guo et al. showed that four stages are necessary and sufficient to realize an ideal $$(2\kappa ,n)$$ -block cipher using the cascade of independent ideal $$(\kappa ,n)$$ -block ciphers with two alternated independent keys, in the indifferentiability paradigm (where a (k, n)-blockcipher has k-bit key space and n-bit message space). As part of their negative results, Guo et al. provided attacks for the 2-round and 3-round cascade constructions with two alternating keys. Further, they gave a heuristic outline of an attack on the 3-round cascade construction with (certain) stronger key schedules. As the second half of this paper, we formalize the attack explored by Guo et al. on the 3-round cascade construction with stronger key schedules and extend the same to any 2n-bit to 3n-bit non-idealized key scheduling function.
A New Keyed Hash Function Based on Latin Squares and Error-Correcting Codes to Authenticate Users in Smart Home Environments

We introduce the scheme of a keyed hash function, also called message authentication code (MAC) based on previously given latin squares and binary linear error-correcting codes. We investigate the properties of the introduced scheme regarding its security and applicability. Further, we give a possible application in a smart home environment, especially for opening the entrance door to a house by using a mobile device.
Multi-input Non-interactive Functional Encryption: Constructions and Applications

We consider a non-interactive secure computation protocol that we call multi-input non-interactive functional encryption (MINI-FE). In a MINI-FE protocol for some class of functionalities $$F$$ , N users independently and non-interactively setup their own pairs of public- and secret-keys. Each user $$i\in \{1, \ldots ,N\}$$ , with knowledge of the public-keys of all other participants, its own secret-key, an identifier $$\textsf{id}$$ and a functionality F, can encode its own input $$x_i$$ to produce a ciphertext $$\textsf{Ct}_i$$ . There is a public evaluation function that, given N ciphertexts $$\textsf{Ct}_1,\ldots ,\textsf{Ct}_N$$ for the same identifier and functionality F, outputs $$F(x_1,\ldots ,x_n)$$ . Moreover, the same public keys can be reused for an unbounded number of computations (for different identifiers). The security essentially guarantees that for any two tuples of inputs that map to the same value under a functionality, the corresponding tuples of ciphertexts are computationally indistinguishable to adversaries that can also corrupt a subset of the users. MINI-FE shares some similarities with decentralized multi-client functional encryption (DMCFE) [Chotard et al. - Asiacrypt '18] but, unlike DMCFE and alike dynamic DMCFE (DDMCFE) [Chotard et al. - Crypto '20], in MINI-FE there is no interaction in the setup phase. Unlike DDMCFE and similarly to traditional secure computation, there is no concept of token and thus the leakage of information is limited to the execution of each computation for a given identifier. In MINI-FE each user can completely work independently and the entire protocol can be executed over a broadcast channel (e.g., a distributed ledger) with just a single message from each user in both the setup and encoding phases. We give an instantiation of a MINI-FE protocol for the Inner-Product functionality from bilinear groups; previous constructions were only known for the summation functionality. We show applications of our protocol to private stream aggregation and secure quadratic voting.
Polarization-Encoded BB84 QKD Transmitter Sourced by a SiGe Light Emitter

We demonstrate a polarization-encoded BB84 transmitter sourced by a SiGe light source and show that such a potentially “all-silicon” QKD scheme can operate well below the QBER threshold at which secret keys can be established.
Chudnovsky-Type Algorithms over the Projective Line Using Generalized Evaluation Maps

Recently, it was shown that the Chudnovsky-type algorithms over the projective line enable a generic recursive construction of multiplication algorithms in finite fields $$\mathbb {F}_{q^n}$$ . This construction is based on the method introduced by D. V. and G. V. Chudnovsky (1987), that generalizes polynomial interpolation to the use of algebraic curves, and specialized to the case of the projective line. More precisely, using evaluation at places of increasing degrees of the rational function field over $$\mathbb {F}_q$$ , it has been proven that one can construct in polynomial time algorithms with a quasi-linear bilinear complexity with respect to the extension degree n. In this paper, we discuss how the use of evaluation with multiplicity, using generalized evaluation maps, can improve this construction.
Quantum Cryptanalysis of 5 Rounds Feistel Schemes and Benes Schemes

In this paper, we provide new quantum cryptanalysis results on 5 rounds (balanced) Feistel schemes and on Benes schemes. More precisely, we give an attack on 5 rounds Feistel schemes in $$\varTheta (2^{2n/3})$$ quantum complexity and an attack on Benes schemes in $$\varTheta (2^{2n/3})$$ quantum complexity, where n is the number of bits of the internal random functions. This improves the best known attack in $$\varTheta (2^n)$$ (before our attack).
QCB is Blindly Unforgeable

QCB is a proposal for a post-quantum secure, rate-one authenticated encryption with associated data scheme (AEAD) based on classical OCB3 and $$\varTheta $$ CB, which are vulnerable against a quantum adversary in the Q2 setting. The authors of QCB prove integrity under plus-one unforgeability, whereas the proof of the stronger definition of blind unforgeability has been left as an open problem. After a short overview of QCB and the current state of security definitions for authentication, this work proves blind unforgeability of QCB. Finally, the strategy of using tweakable block ciphers in authenticated encryption is generalised to a generic blindly unforgeable AEAD model.
Photonic Max-Pooling for Deep Neural Networks Using a Programmable Photonic Platform

We propose a photonic max-pooling architecture for photonic neural networks which is compatible with integrated photonic platforms. As a proof of concept, we have experimentally demonstrated the max-pooling function on a programmable photonic platform consisting of a hexagonal mesh of Mach-Zehnder interferometers.
Robot Motion Planning in ROS Environment

This paper proposes a method for motion planning and simulation for manipulator robots in the presence of obstacles in the workspace realizing large movements without dividing the stroke into successive parts. The approach has been tested with different solvers. In particular, it is observed that the RRT Connect planner has very good abilities to solve the problem although some difficulties remain when a large part of the workspace between the initial and final position is occupied by an obstacle.
Programmable Photonic Neural Networks for advanced Machine Learning tasks

Photonics holds the promise of reshaping Machine Learning and High-Performance Computing hardware landscape, stripping it of unnecessary signal conversion overhead, complying with strict power dissipation envelopes while unlocking unrivaled compute and bandwidth capacity.
Demonstration of Data-Sovereign Telemetry Broker for Open and Disaggregated Optical Networks

We demonstrate a novel and modular telemetry broker that allows remote collection and exchange of telemetry data. Our proposal enforces data sovereignty principles powered by International Data Spaces components and enables unprecedented data ownership control.
Upgrade of Deep Neural Network-based Optical Monitors by Communication-Efficient Federated Learning

We present an efficient scheme to upgrade DNN-based optical monitors collaboratively trained through multiple network operators without revealing each confidential data, applying federated learning with pre-model size reduction based on transferable lottery ticket hypothesis.
A chip-based quantum access network without trusted relays

I will report our recent efforts towards the construction of a chip-based quantum access network using the measurement-device-independent protocols. This includes the recent experiments on Si chip-based QKD, high-rate QKD, twin-field QKD and all-photonic quantum repeater.
Deep Reservoir Computing for 100 Gbaud PAM6 IM/DD Transmission Impairment Mitigation

We experimentally evaluate a deep Reservoir Computing (RC)-based post-equalization for 100 Gbaud PAM6 IM/DD transmissions. It achieves ~1 dB higher sensitivity than DFE, and ~50% implementation complexity reduction compared with the conventional RC configuration.
Optimization of Classical Light Wavelengths Coexisting with C-band Quantum Networks for Minimal Noise Impact

We investigate the optimal coexisting classical light wavelengths to use alongside C- band quantum networks to minimize noise from spontaneous Raman scattering and discuss techniques for optimizing coexisting time synchronization systems for teleportation and entanglement swapping.
Calculating with Phase Opens up the High-Precision and High-Reconfigurability Integrated Photonic Computing

We propose and experimentally demonstrate a novel phase-based optical computing system integrated with photonic AD/DA converters. Further simulation shows that our system can perform 15-bit arithmetic operations when the SNR is around 34 dB.
Programmable tanh- and ReLU-like Optoelectronic Activation Functions for Neuromorphic Photonic Circuits

We demonstrate reconfigurable tanh- and ReLU-like nonlinear activation functions for incoherent neuromorphic photonics using a balanced photodiode assembled with a programmable electronic TIA chip. Experimental results up to 10 Gb/s line-rates are presented.
MAESTRO: MAke-bEfore-break StraTegy for Reconfiguration in Optical Datacenters

We present a MAke-bEfore-break StraTegy for Reconfiguration in Optical datacenters (MAESTRO). The simulation results show a reduction in packet loss by up to 98% compared to a baseline reconfiguration method.
A Modified Mesh with Individually Monitored Interferometers for Fast Programmable Optical Processors

We demonstrate a novel mesh of interferometers for programmable optical processors. Employing an efficient programming scheme, the proposed architecture improves energy efficiency by 83% maintaining the same computation accuracy for weight matrix changes at 2 kHz.
DDOS attack identification via a silicon photonic Deep Neural Network with 50 GHz input and weight update

We experimentally demonstrate distributed denial of service (DDOS) attack identification using Deep Learning over a photonic neuromorphic engine that supports both input signal and weight update at 50 GHz, reporting a Cohen’s κ-score of 0.636.
Singleton Bounds for Entanglement-Assisted Classical and Quantum Error Correcting Codes

We show that entirely quantum Shannon theoretic methods, based on von Neumann entropies and their properties, can be used to derive Singleton bounds on the performance of entanglement-assisted hybrid classical-quantum (EACQ) error correcting codes. Concretely, we show that the triple-rate region of qubits, cbits and ebits of possible EACQ codes over arbitrary alphabet sizes is contained in the quantum Shannon theoretic rate region of an associated memoryless erasure channel, which turns out to be a polytope. We show that a large part of this region is attainable by certain EACQ codes, whenever the local alphabet size (i.e., Hilbert space dimension) is large enough, in keeping with known facts about classical and quantum maximum distance separable (MDS) codes: in particular, all of its extreme points and all but one of its extremal lines. The attainability of the remaining one extremal line segment is left as an open question.
Cryptocurrencies and Portfolio Performance. Does Cryptocurrency Help Improve the Portfolio Performance?

This paper investigates the performance of cryptocurrencies and market indices. Using the dynamic conditional correlation (DCC) model, the result shows that cryptocurrencies and market indices, contrary to much of the literature, tend to move in the same direction, resulting in little or no benefits in portfolio management. Dividing into the sub-sample period, cryptocurrencies have moved even more strongly with market indices during the recent period after the COVID-19 pandemic, indicating the possibility of no hedging benefit. This paper shows that inclusion of cryptocurrency in a portfolio increases the return as well as volatility, as the risk-adjusted return does not show any sign of improvement. A portfolio comprising the FTSE 100 Index seems to receive the greatest benefit of including cryptocurrencies as the risk-adjusted performance improves.
Development of “Trashmart” Application for Used Materials Marketplace Based on Android

The goal of this research is to design an Android-based application to facilitate the sale and purchase of secondhand construction materials. This thesis' research methodology consists of two components: data collection and design. Using questionnaire evaluation, the literature review procedure, and analysis of similar apps, data was obtained. The design was modified using the waterfall methodology, and the Unified Modeling Language (UML) diagram was implemented. The evaluation is conducted in two ways: questionnaire evaluations and comparisons with similar applications. Those in search of used materials that correspond to their measurements and application preferences can benefit from the results that can be obtained.
Language Teachers’ Perspectives on Web 2.0 in Education

Technology has advanced rapidly, and it goes to all sectors, including education. One type of technologies, Web 2.0, has been seen as a promising tool for education, including for language education. However, this has not been maximally utilized here in Indonesia. This research aims to hear the perspectives of language teachers on the use of Web 2.0 as their teaching tool. A qualitative study was conducted with thirty participants who were all language teachers. They were given a questionnaire to fill in and were interviewed for more comprehensive answers. Looking into their answers, it could be said that most teachers welcomed Web 2.0, but they might need some time to implement it.
Study of Creative Hub in Central Jakarta for Sustainable Human Environment

A creative hub is a place, both physical and virtual, that brings together creative people that serves as a meeting place, providing space and support for networking, business development, and community engagement in the creative, cultural and technology sectors. The main activities carried out by creative workers are work, exhibitions, seminars, and workshops. With the development of the creative industry in Indonesia which is quite rapid, it is necessary to have a container or facility that can accommodate the activities of creative industry workers, especially those that focus on the fashion, craft, and application developer sub-sectors to create a sustainable human environment. To support these activities, it is necessary to conduct study on the activities of related creative workers to produce a space or facility needed by creative workers in the three sub-sectors. The study was done by the qualitative method. It can be known the main activities, supporting activities, main facilities and supporting facilities are needed for sustainable human environment, so that users can be more productive and carry out activities comfortably.
Numerical identification of the elasticity tensor of heterogeneous materials made of Silicon Carbide and Titanium by the Finite Element Model Updating (FEMU)

This work is subjected to the development of a method to identify the elasticity tensor of homogeneous and heterogeneous materials. The materials are created in the form of checkerboards. We solved the direct problem to obtain the strain field using the finite element method, after obtaining this strain field, we created synthetic experimental displacement data by simulation. A re-calibration of the created experimental and simulated data is done based on the principle of the finite element model updating (FEMU), used in almost all domains, in the inverse problem. The minimization of the cost function obtained by FEMU is done by Levenberg-Marquardt algorithm which is very fast and elegant algorithm. A complete study has been done by studying the sensitivity of the identified values with respect to the refinement of the mesh and with respect to the level of disturbance.
Stateful Layered Chain Model to Improve the Scalability of Bitcoin

Bitcoin becomes the focus of scientific research in the modern era. Blockchain is the underlying technology of Bitcoin because of its decentralization, transparency, trust-less, and immutability features. However, blockchain can be considered the cause of Bitcoin scalability issues, especially storage. Nodes in the Bitcoin network need to store the full blockchain to validate transactions. Over time, the blockchain size will be bulky. So, the full nodes will prefer to leave the network. This leads to the blockchain being centralized and trusted, and the security will be adversely affected. This paper proposes a Stateful Layered Chain Model based on storing accounts’ balances to reduce the Bitcoin blockchain size. This model changes the structure of the traditional blockchain from blocks to layers. The experimental results demonstrated that the proposed model reduces the blockchain size by about 50.6 %. Implicitly, the transaction throughput can also be doubled.
Two instances of random access code in the quantum regime

We consider two classes of quantum generalisations of Random Access Code (RAC) and study lower bounds for probabilities of success for such tasks. It provides a useful framework for the study of certain information processing tasks with constrained resources. The first class is based on a random access code with quantum inputs and output known as No-Signalling Quantum RAC (NS-QRAC) [A. Grudka et al. Phys. Rev. A 92, 052312 (2015)], where unbounded entanglement and constrained classical communication are allowed, which can be seen as quantum teleportation with constrained classical communication, for which we provide a quantum lower bound. We consider two modifications to the NS-QRAC scenario, first where unbounded entanglement and constrained quantum communication is allowed and, second where bounded entanglement and unconstrained classical communication are allowed, where we find a monogamy relation for the transmission fidelities, which -- in contrast to the usual communication schemes -- involves multiple senders and a single receiver. We provide lower bounds for these scenarios. The second class is based on a random access code with a quantum channel and shared entanglement [A. Tavakoli et al. PRX Quantum 2 (4) 040357 (2021)]. We study the set of tasks where two inputs made of two digits of $d$-base are encoded over a qudit and a maximally entangled state, which can be seen as quantum dense coding with constrained quantum communication, for which we provide quantum lower bounds for $d=2,3,4$. The encoding employed utilises Gray codes.
Decentralized Blockchain-Enabled Employee Authentication System

In recent years, there have been many attempts to introduce blockchain-based identity management solutions, which allow the user to take over control of his/her own identity. In this paper, the authors have reviewed in-depth existing blockchain-based identity management papers and patents published online. Based on that analysis of the literature, a system will be implemented which will come up with the current issues and try to minimize them. Being transparent, immutable, and decentralized in nature, blockchain mechanism is found to be a better technology which can reduce the corruption in the experimental scenario. The objective is to develop a decentralized system which can be used for the verification of the employees in an organization. This is done to stop or reduce the cases of identity theft and data leakage in recent time. This system will be using Ethereum blockchain platform for monitoring the information and smart contract for authentication.
Distinguishing articles in questionable and non-questionable journals using quantitative indicators associated with quality

This ongoing study investigates the viability of distinguishing articles in questionable journals (QJs) from those in non-QJs on the basis of quantitative indicators typically associated with quality, and what can be deduced about the quality of articles in QJs based on the differences observed. I contrast the length of abstracts and full-texts, prevalence of spelling errors, text readability, number of references and citations, and other characteristics of 1,714 articles from 31 QJs, 1,691 articles from 16 journals indexed in Web of Science (WoS), and 1,900 articles from 45 non-WoS/non-QJs, all in the field of psychology. Initial results indicate that there are differences between QJs and non-QJ samples, however these are relatively small, perhaps indicating that QJs may not substantially differ from non-QJs on these quantitative indicators of quality. However, I intend to use additional analyses to further explore any potential differences.
BRIDGE Theory: A New Method Combining Quantitative and Qualitative Evaluation

How to build “new standards” after breaking “Siwei” is a hot and difficult issue in the current reform of research evaluation, which urgently needs good theoretical and methodological support. In this regard, this paper puts forward the BRIDGE theory of research evaluation of scientific researchers’ achievements, which is about to integrate the reasonable elements in the quantitative evaluation based on SCI papers into the “new standard” based on peer review, so as to build a bridge between quantitative analysis and qualitative evaluation. BRIDGE theory is an important development of quantitative and qualitative evaluation method, and has a wide application prospect.
Digital tools in education

Over the past decades, the demands placed on education systems have changed. Workers in the labour market need certain competences such as technical, methodological, social and personal competences. The aim of education today is to create a new educational paradigm that prepares the workforce of the future for the new challenges. This change is accompanied by the introduction of new didactic concepts such as blended learning, which combines the advantages of face-to-face and online learning with the use of digital teaching tools that can help develop the desired competences. The pandemic has led to a huge and rapid increase in the use of digital tools in education, which has necessitated the development of guidelines for their use. Therefore, the aim of this work is to present the digital tools that have been introduced into education and that require the development of digital competences by students and teachers, thus enabling teachers and managers of educational institutions to take advantage of the use of digital tools in the post-pandemic renewed situation.