bluuebunny/crossref_metadata_2025_split huggingface dataset:
Expresiones liberadoras y transformadoras de un mundo socialmente prefigurado: arte femenino trasgresor
Authors: Beltrán Castellanos Ara , Beltrán Castellanos Mirla 
Published: October 2024

El arte, es una forma de representar y manifestar sentimientos y emociones humanas de armonía, amor y serenidad; y a la vez es una forma de presentar y exteriorizar, hacer visibles las injusticias, malas prácticas culturales y adoctrinamientos.
En el presente artículo, se presentarán una serie de reflexiones a partir de las experiencias artísticas de dos mujeres talentosas colombianas, que encontraron en las representaciones visuales una forma de denunciar el control femenino impartido por la educación conductual, las instituciones como la Iglesia y la publicidad. Así mismo, se analizó la continua represión femenina que aún se presenta en nuestros días, las causas de la violencia de género y por qué el machismo sigue enraizado en la cotidianidad de la sociedad. Estas reflexiones se sitúan en la revisión de la discusión que plantea la autora de la tesis, en la que se vinculan elementos de la educación tradicional colombiana y la expresión artística femenina contemporánea, desde casos particulares de dos artistas que buscan romper con la tradición, las maneras, las formas y los roles que se le han querido adjudicar a lo femenino por parte de una mirada de una sociedad igualmente tradicional y por qué no, anclada en una atemporalidad restrictiva.
Al hacer el análisis de la expresión artística femenina en Colombia, se evidencia que es posible una emancipación de la mujer y comprobar que, a pesar de la represión continua, se pueden fijar propuestas como las aquellas que provienen de las manifestaciones artísticas que hoy se analizarán para llegar a la liberación.
Kedaulatan Maritim dan Pengawasan Lalu Lintas Maritim di Indonesia
Authors: Bokau Joe Ronald Kurniawan , Irwan  , Haryani Rina 
Published: October 2024

As the largest archipelagic country in the world and located right in between of two oceans, Indonesia benefited from its geographical location especially since the Malacca Strait become the major marine traffic in the world. Not only that, Indonesia also established three major waterways called Archipelagic Sea Lanes (ASL) where every international ship obliged to passing by Indonesian territorial waters without disturbance with the straits such as Sunda Strait and Lombok Strait as the major strait. In economic development, these policies impacted the growth of several major cities in Indonesia such as Medan in the Sumatera Island, Jakarta and Surabaya in Java Island and Makassar in Sulawesi Island. The archipelagic countries as defined in the UNCLOS as the waters around, between and connecting the islands belong to the Indonesian irrespective the size or dimension, therefore a constant vigilant must be conduct by Indonesian Government. In this research, we utilize AIS data from third party then analyze from the numbers of ships travelling in the waterway and the needs to maintain a state-of-the-art monitoring of every ship in the territorial waters.

ABSTRAK
Sebagai negara kepulauan yang terbesar didunia dan terletak diantara dua samudera, Indonesia diuntungkan dari letak geografisnya terlebih sejak Selat Malaka menjadi jalur pelayaran utama dunia. Tidak hanya itu, Indonesia juga membuka tiga jalur utama pelayaran yang disebut dengan Alur Laut Kepulauan Indonesia (ALKI) dimana setiap kapal internasional dapat melewati alur pelayaran tersebut dengan damai dan tidak mengganggu kedaulatan Indonesia contohnya adalah Selat Sunda dan Selat Lombok. Dari perkembangan ekonomi, kebijakan tersebut berdampak pada pembangunan kota-kota besar seperti Medan di Pulau Sumatera, Jakarta dan Surabaya di Pulau Jawa dan Makassar di Pulau Sulawesi. Definisi negara kepulauan sesuai UNCLOS adalah segala perairan disekitar, diantara dan yang menghubungkan antara pulau-pulau merupakan bagian dari wilayah Indonesia apapun ukuran dan dimensinya, oleh sebab itu pengawasan yang berkesinambungan harus terus dilakukan oleh Pemerintah Indonesia. Penelitian ini menggunakan data AIS (Automatic Identification System) untuk melihat lalu lintas pelayaran di Indonesia serta mengambil langkah-langkah strategis untuk mengawasi pergerakan dari kapal-kapal yang berada di wilayah perairan teritorial tersebut.
Revisiting the Slot-to-Coefficient Transformation for BGV and BFV
Authors: Geelen Robin 
Published: October 2024

Numerous applications in homomorphic encryption require an operation that moves the slots of a ciphertext to the coefficients of a different ciphertext. For the BGV and BFV schemes, the only efficient algorithms to implement this slot-to-coefficient transformation were proposed in the setting of non-power-of-two cyclotomic rings. In this paper, we devise an FFT-like method to decompose the slot-to-coefficient transformation (and its inverse) for power-of-two cyclotomic rings. The proposed method can handle both fully and sparsely packed slots. Our algorithm brings down the computational complexity of the slot-to-coefficient transformation from a linear to a logarithmic number of FHE operations, which is shown via a detailed complexity analysis.
The new procedures are implemented in Microsoft SEAL for BFV. The experiments report a speedup of up to 44 times when packing 2^12 elements from GF(8191^8). We also study a fully packed bootstrapping operation that refreshes 2^15 elements from GF(65537) and obtain an amortized speedup of 12 times.
Amortizing Circuit-PSI in the Multiple Sender/Receiver Setting
Authors: van Baarsen Aron , Stevens Marc 
Published: October 2024

Private set intersection (PSI) is a cryptographic functionality for two parties to learn the intersection of their input sets, without leaking any other information. Circuit-PSI is a stronger PSI functionality where the parties learn only a secret-shared form of the desired intersection, thus without revealing the intersection directly. These secret shares can subsequently serve as input to a secure multiparty computation of any function on this intersection.
In this paper we consider several settings in which parties take part in multiple Circuit-PSI executions with the same input set, and aim to amortize communications and computations. To that end, we build up a new framework for Circuit-PSI around generalizations of oblivious (programmable) PRFs that are extended with offline setup phases. We present several efficient instantiations of this framework with new security proofs for this setting. As a side result, we obtain a slight improvement in communication and computation complexity over the state-of-the-art semi-honest Circuit-PSI protocol by Bienstock et al. (USENIX '23). Additionally, we present a novel Circuit-PSI protocol from a PRF with secret-shared outputs, which has linear communication and computation complexity in the parties' input set sizes, and is able to realize a stronger security notion. Lastly, we derive the potential amortizations over multiple protocol executions, and observe that each of the presented instantiations is favorable in at least one of the multiple-execution settings.
The Perils of Limited Key Reuse: Adaptive and Parallel Mismatch Attacks with Post-processing Against Kyber
Authors: Guo Qian , Mårtensson Erik , Åström Adrian 
Published: October 2024

The Module Learning With Errors (MLWE)-based Key Encapsulation Mechanism (KEM) Kyber is NIST's new standard scheme for post-quantum encryption. As a building block, Kyber uses a Chosen Plaintext Attack (CPA)-secure Public Key Encryption (PKE) scheme, referred to as Kyber.CPAPKE. In this paper we study the robustness of Kyber.CPAPKE against key mismatch attacks.
We demonstrate that Kyber's security levels can be compromised if having access to a few mismatch queries of Kyber.CPAPKE, by striking a balance between the parallelization level and the cost of lattice reduction for post-processing. This highlights the imperative need to strictly prohibit key reuse in Kyber.CPAPKE.
We further propose an adaptive method to enhance parallel mismatch attacks, initially proposed by Shao et al. at AsiaCCS 2024, thereby significantly reducing query complexity. This method combines the adaptive attack with post-processing via lattice reduction to retrieve the final secret key entries. Our method proves its efficacy by reducing query complexity by 14.6 % for Kyber512 and 7.5 % for Kyber768/Kyber1024.
Furthermore, this approach has the potential to improve multi-value Plaintext-Checking (PC) oracle-based side-channel attacks and fault-injection attacks against Kyber itself.
A Note on Related-Tweakey Impossible Differential Attacks
Authors: Bonnetain Xavier , Lallemand Virginie 
Published: October 2024

In this note we review the technique proposed at ToSC 2018 by Sadeghi et al. for attacks built upon several related-tweakey impossible differential trails. We show that the initial encryption queries are improper and lead the authors to misevaluate a filtering value in the key recovery phase. We identified 4 other papers (from Eurocrypt, DCC, and 2 from ToSC) that follow on the results of Sadeghi et al. and in three of them the flawed technique was reused.
We thus present a careful analysis of these types of attacks and give generic complexity formulas similar to the ones proposed by Boura et al. at Asiacrypt 2014. We apply these to the aforementioned papers and provide patched versions of their attacks. The main consequence is an increase in the memory complexity. We show that in many cases (a notable exception being quantum impossible differentials) it is possible to recover the numeric time estimates of the flawed analysis, and in all cases we were able to build a correct attack reaching the same number of rounds.
Constant-Round YOSO MPC Without Setup
Authors: Kolby Sebastian , Ravi Divya , Yakoubov Sophia 
Published: October 2024

YOSO MPC (Gentry et al., Crypto 2021) is a new MPC framework where each participant can speak at most once. This models an adaptive adversary’s ability to watch the network and corrupt or destroy parties it deems significant based on their communication. By using private channels to anonymous receivers (e.g. by encrypting to a public key whose owner is unknown), the communication complexity of YOSO MPC can scale sublinearly with the total number N of available parties, even when the adversary’s corruption threshold is linear in N (e.g. just under N/2). It was previously an open problem whether YOSO MPC can achieve guaranteed output delivery in a constant number of rounds without relying on trusted setup. In this work, we show that this can indeed be accomplished. We demonstrate three different approaches: the first two (which we call YaOSO and YOSO-GLS) use two and three rounds of communication, respectively. Our third approach (which we call YOSO-LHSS) uses O(d) rounds, where d is the multiplicative depth of the circuit being evaluated; however, it can be used to bootstrap any constant-round YOSO protocol that requires setup, by generating that setup within YOSO-LHSS. Though YOSO-LHSS requires more rounds than our first two approaches, it may be more practical, since the zero knowledge proofs it employs are more efficient to instantiate. As a contribution of independent interest, we introduce a verifiable state propagation UC functionality, which allows parties to send private message which are verifiably derived in the “correct” way (according to the protocol in question) to anonymous receivers. This is a natural functionality to build YOSO protocols on top of.
Quantum Procedures for Nested Search Problems
Authors: Schrottenloher André , Stevens Marc 
Published: October 2024

In this paper we study search problems that arise very often in cryptanalysis: nested search problems, where each search layer has known degrees of freedom and/or constraints. A generic quantum solution for such problems consists of nesting Grover's quantum search algorithm or amplitude amplification (QAA) by Brassard et al., obtaining up to a square-root speedup on classical algorithms. However, the analysis of nested Grover or QAA is complex and introduces technicalities that in previous works are handled in a case-by-case manner. Moreover, straightforward nesting of l layers multiplies the complexity by a constant factor (pi/2)^l.
In this paper, we aim to remedy both these issues and introduce a generic framework and tools to transform a classical nested search into a quantum procedure. It improves the state-of-the-art in three ways: 1) our framework results in quantum procedures that are significantly simpler to describe and analyze; 2) it reduces the overhead factor from (pi/2)^l to sqrt(l); 3) it is simpler to apply and optimize, without needing manual quantum analysis. We give generic complexity formulas and show that for concrete instances, numerical optimizations enable further improvements, reducing even more the gap to an exact quadratic speedup.
We demonstrate our framework by giving a tighter analysis of quantum attacks on reduced-round AES.
Reinventing BrED: A Practical Construction
Authors: Majumder Avishek , Mukherjee Sayantan 
Published: October 2024

Broadcast Encryption (BE) allows a sender to send an encrypted message to multiple receivers. In a typical broadcast encryption scenario, the broadcaster decides the set of users who can decrypt a particular ciphertext (denoted as the privileged set). Gritti et al. (IJIS'16) introduced a new primitive called Broadcast Encryption with Dealership (BrED), where the dealer decides the privileged set. A BrED scheme allows a dealer to buy content from the broadcaster and sell it to users. It provides better flexibility in managing a large user base. To date, quite a few different constructions of BrED schemes have been proposed by the research community.
We find that all existing BrED schemes are insecure under the existing security definitions. We demonstrate a concrete attack on all the existing schemes in the purview of the existing security definition. We also find that the security definitions proposed in the state-of-the-art BrED schemes do not capture the real world. We argue about the inadequacy of existing definitions and propose a new security definition that models the real world more closely. Finally, we propose a new BrED construction and prove it to be secure in our newly proposed security model.
Special Soundness in the Random Oracle Model
Authors: Wikström Douglas 
Published: October 2024

We generalize the optimal knowledge extractor for constant-round special sound protocols presented by Wikström (2018) to a knowledge extractor for the corresponding non-interactive Fiat-Shamir proofs in the random oracle model and give an exact analysis of the extraction error and running time.
Relative the interactive case the extraction error and the running time are both asymptotically increased by a multiplicative factor equal to the number of oracle queries made by the prover.
Through carefully chosen notation, novel concepts, and a technical lemma, we effectively recast the extraction problem of the notoriously complex non-interactive case to the interactive case. Thus, our approach may be of independent interest.
Key Rank Estimation Methods: Comparisons and Practical Considerations
Authors: Hay Rebecca , Oswald Elisabeth 
Published: October 2024

New proposals for scalable key rank estimation methods have appeared recently, in particular the sampling based approach MCRank. The idea is that one can consistently estimate the key rank by sampling only a small portion of the key space as a “proxy”, leading to both an accurate and scalable approach, at least in comparison with another approach based on histograms. We show that the (earlier) GEEA algorithm is in fact a sampling based algorithm, and provide an in-depth comparison between GEEA (when adapted to produce rank estimates rather than guessing entropy estimates), GM bounds, MCRank and the currently most performant counting based rank estimation as implemented in the Labynkyr library. We find that although MCRank does live up to the promised accuracy and scalability for probability-based distinguishers, it fails to handle cases with unusual distinguisher distributions.
Furthermore, we put forward a novel proposal for a highly scalable key rank estimation method by introducing the notion of an “attacker budget”. Our proposal is based on the idea that, in particular for very long keys, the exact key rank is less important than the knowledge whether a key is within a certain bound. Thus our “budget approach” is based on efficiently checking if the result of an attack is such that the attacker's budget suffices for successful enumeration. Our budget approach scales linearly with the key size and thus enables security estimations even for post-quantum key lengths.
Matching radar signals and fingerprints with MPC
Authors: Mortensen Benjamin , Nordal Mathias , Strand Martin 
Published: October 2024

Vessels can be recognised by their navigation radar due to the characteristics of the emitted radar signal. This is particularly useful if one wants to build situational awareness without revealing one's own presence. Most countries maintain databases of radar fingerprints but will not readily share these due to national security regulations. Sharing of such information will generally require some form of information exchange agreement.
However, all parties in a coalition benefit from correct identification. We use secure multiparty computation to match a radar signal measurement against secret databases and output plausible matches with their likelihoods. We also provide a demonstrator using MP-SPDZ.
Participation of Citizen as Social Capital in LAPOR! Application in Indonesia
Authors: Febriani Rika , Luthfi Zaky Farid , Waldi Atri 
Published: October 2024

Citizen engagement is crucial for the success of smart cities. In urban areas, communities as social capital has an interpersonal bond that unites people. Due to the complexity of urban issues like pollution, waste, and population density, citizens can monitor the government's work priorities to solve the problem. This article focuses on smart cities from a human-centered perspective, emphasizing the role of information technology. In Indonesia, citizens' rights awareness is facilitated by the National Public Service Complaint Management System (SP4N) or People's Aspiration and Online Complaints Service (LAPOR!), which acts as social capital. This article explores five key aspects of smart cities and smart citizenship: governance, citizen participation, infrastructure, public spaces, and urban livability. While ICT-driven approaches can swiftly transform cities, a community-based approach fosters long-term shifts. Meanwhile, limited citizen involvement contributes to ecosystem degradation in Indonesia and underscores the urgency and importance of citizen engagement in urban planning. In democratic societies, citizens hold power, and concepts of smart citizenship encompass civic intelligence and, at the same time, also value local knowledge. In Indonesia, LAPOR! reflects smart citizenship, enabling transparent reporting of aspirations and complaints. However, factors like limited access and education of citizens affect its use. This research used qualitative methods with content analysis methods. Qualitative content analysis is used to examine the textual content of websites. Using LAPOR! SP4N in Indonesia to see the implementation of the concept of smart society and smart city. Participatory processes should contribute substantially to urban planning and governance. Information technology serves as a temporary solution for long-term urban planning issues. Broader concerns like public policy and participatory democracy must also be considered. In conclusion, this article explores the dynamic relationship between smart cities and smart citizenship, highlighting the importance of active citizen engagement and the potential of technology to empower communities for positive urban transformations.
Analisis Kebijakan Local Currency Settlement Antara Indonesia Dan China
Authors: Nitasya Filza Diva , Sabila Laura , Felisia Savira 
Published: October 2024

Tujuan dari penelitian ini adalah untuk membahas kebijakan Penyelesaian Mata Uang Lokal antara Indonesia dan China. Menggunakan metode analisis SWOT dengan mengumpulkan dan mengevaluasi data dari berbagai sumber publikasi akademik. Hubungan antara Indonesia dan China, keduanya memegang posisi penting dalam tatanan global. Penyelesaian Mata Uang Lokal (LCS) sendiri adalah penyelesaian transaksi bilateral yang dilakukan antara Indonesia dan China untuk dapat menggunakan mata uang lokal yang berlaku di masing-masing negara. Pelaksanaan LCS membawa banyak manfaat bagi Indonesia, termasuk peningkatan volume perdagangan antara Indonesia dan China, kemudahan pembayaran menggunakan mata uang lokal, dan penguatan hubungan bilateral antara Indonesia dalam perdagangan dan investasi.

The purpose of this research is to discuss the Local Currency Settlement policy between Indonesia and China. Using the SWOT analysis method by collecting and evaluating data from various sources of academic publications. The relationship between Indonesia and China, both of which hold significant positions in the global order. The Local Currency Settlement (LCS) itself is a bilateral transaction settlement conducted between Indonesia and China to be able to use local currencies that are valid in each country. The implementation of LCS brings many benefits to Indonesia, including increased trade volume between Indonesia and China, ease of payment using local currencies, and strengthening bilateral relations between Indonesia in trade and investment.
Pendidikan Politik Pemilih Muda Oleh Komisi Pemilihan Umum Kota Bandung Melalui Program Rumah Pintar Jelang Pemilihan Umum 2024
Authors: Hartono Syakira Syafiqya Tsabita Putri , Djuyandi Yusa 
Published: October 2024

Abstrak
Pendidikan politik merupakan proses yang krusial dan melekat pada KPU, ditujukan untuk memastikan pemilih memahami esensi dilaksanakannya pemilu dan dampaknya bagi demokrasi. Salah satu segmentasi pemilih yang berperan besar bagi pemilu di Indonesia adalah pemilih muda. Pendidikan politik bagi pemilih muda di Kota Bandung dalam rangka mendorong kesadaran dan kepribadian politik dapat dilakukan dengan berbagai cara, salah satunya adalah dengan pemanfaatan Rumah Pintar Pemilu (RPP) KPU Kota Bandung. Penelitian ini menggunakan metode penelitian kualitatif dengan wawancara sebagai sumber data primer, studi literatur dan dokumentasi sebagai sumber data sekunder. Teknik wawancara menggunakan teknik purposive, informan berasal dari KPU Kota Bandung dan pemilih muda yang pernah berkunjung ke RPP KPU Kota Bandung. Teknik analisis data dilakukan dengan teknik Miles dan Huberman yaitu dengan proses reduksi, penyajian data, dan verifikasi. Proses triangulasi data juga dalam penelitian ini menggunakan triangulasi sumber data. Hasil dari penelitian menunjukkan pendidikan politik melalui RPP KPU Kota Bandung kepada pemilih muda dilakukan dengan pengadaan secara fisik dan juga digitalisasi materi-materi politik. Aktualisasinya, RPP juga menyediakan informasi sesuai kebutuhan pemilih muda. Proses pendidikan politik melalui RPP KPU Kota Bandung memberikan dampak yang cukup signifikan terhadap pemahaman, kesadaran, dan kepribadian politik pemilih muda khususnya dalam agenda pemilu serentak 2024.

Kata Kunci: Pendidikan Politik, Rumah Pintar Pemilu, Pemilih Muda, KPU Kota Bandung.