Field Extension in Secret-Shared Form and Its Applications to Efficient Secure Computation

2019 ◽  
pp. 343-361 ◽  
Author(s):  
Ryo Kikuchi ◽  
Nuttapong Attrapadung ◽  
Koki Hamada ◽  
Dai Ikarashi ◽  
Ai Ishida ◽  
...  
Keyword(s):  
Field Extension ◽  
Secure Computation

Faktor-Faktor yang Berhubungan dengan Kinerja Penyuluh Pertanian di Kabupaten Ciamis Jawa Barat

2020 ◽  
Vol 4 (4) ◽  
pp. 545
Author(s):  
Nur Puti Kurniawati ◽  
Dwi Sadono ◽  
Endang Sri Wahyuni
Keyword(s):  
Achievement Motivation ◽  
Census Data ◽  
Work Motivation ◽  
Agricultural Extension ◽  
Field Extension ◽  
Need For Achievement ◽  
Extension Agent ◽  
Spearman Correlation Test ◽  
And Performance ◽  
The Relationship

Agricultural extension agent was the main spearhead in carrying out counseling. A good agricultural extension agent can be reflected in their performance. The purpose of this study were: (1) describe the characteristics of agricultural extension agent, (2) describe the level of competence, level of work motivation, and describe level of performance of agricultural extension agent, (3) analyze the relationship between characteristics of agricultural extention agent and the level of performance of agricultural extension agent, (4) analyze the relationship between the level of competency of agricultural extension agent and the level of performance of agricultural extension agent, (5) analyze the relationship between the level of motivation of agricultural extension agent and the level of performance of agricultural extension agent. Responden in this study were 48 field extension agent who are civil servant in Ciamis Regency West Java and selected by census. Data were analyzed using Rank Spearman correlation test. The results showed that agricultural extension agent in Ciamis Regency were dominated by extension agent who were old, undergraduate educated, had little training, and had a long working period. Agricultural extension agent in Ciamis Regency generally have sufficient competency which tends to be high and generally dominated by the need for achievement motivation. The results also show that there is a relationship between managerial competence and performance, social competence with performance, technical competence with performance, level of competency with performance, and the need for achievement with performance.Keywords: Agricultural Extension Agent,Competence, Motivation, Performance.

Unconditionally Secure Computation with Reduced Interaction

2016 ◽  
pp. 420-447 ◽  
Author(s):  
Ivan Damgård ◽  
Jesper Buus Nielsen ◽  
Rafail Ostrovsky ◽  
Adi Rosén
Keyword(s):  
Secure Computation

scholarly journals Actively revealing card attack on card-based protocols

2021 ◽  
Author(s):  
Ken Takashima ◽  
Daiki Miyahara ◽  
Takaaki Mizuki ◽  
Hideaki Sone
Keyword(s):  
Secure Computation ◽  
Malicious Attack ◽  
Formal Framework ◽  
Almost All ◽  
And Function

AbstractIn 1989, den Boer presented the first card-based protocol, called the “five-card trick,” that securely computes the AND function using a deck of physical cards via a series of actions such as shuffling and turning over cards. This protocol enables a couple to confirm their mutual love without revealing their individual feelings. During such a secure computation protocol, it is important to keep any information about the inputs secret. Almost all existing card-based protocols are secure under the assumption that all players participating in a protocol are semi-honest or covert, i.e., they do not deviate from the protocol if there is a chance that they will be caught when cheating. In this paper, we consider a more malicious attack in which a player as an active adversary can reveal cards illegally without any hesitation. Against such an actively revealing card attack, we define the t-secureness, meaning that no information about the inputs leaks even if at most t cards are revealed illegally. We then actually design t-secure AND protocols. Thus, our contribution is the construction of the first formal framework to handle actively revealing card attacks as well as their countermeasures.

scholarly journals Normal Bases on Galois Ring Extensions

Symmetry ◽  
2018 ◽  
Vol 10 (12) ◽  
pp. 702
Author(s):  
Aixian Zhang ◽  
Keqin Feng
Keyword(s):  
Signal Processing ◽  
Finite Field ◽  
Block Cipher ◽  
Field Extension ◽  
Galois Ring ◽  
Normal Basis ◽  
Galois Rings ◽  
Ring Extension ◽  
Galois Fields ◽  
Normal Bases

Normal bases are widely used in applications of Galois fields and Galois rings in areas such as coding, encryption symmetric algorithms (block cipher), signal processing, and so on. In this paper, we study the normal bases for Galois ring extension R / Z p r , where R = GR ( p r , n ) . We present a criterion on the normal basis for R / Z p r and reduce this problem to one of finite field extension R ¯ / Z ¯ p r = F q / F p ( q = p n ) by Theorem 1. We determine all optimal normal bases for Galois ring extension.

High Data Rate Alamouti Code From Field Extension

2006 ◽  
Vol 40 (4) ◽  
pp. 489-494 ◽  
Author(s):  
R Vishwanath ◽  
Manav R Bhatnagar
Keyword(s):  
Field Extension ◽  
Data Rate ◽  
High Data Rate ◽  
High Data ◽  
Alamouti Code

scholarly journals Martini Coarse-Grained Force Field: Extension to RNA

2017 ◽  
Vol 113 (2) ◽  
pp. 246-256 ◽  
Author(s):  
Jaakko J. Uusitalo ◽  
Helgi I. Ingólfsson ◽  
Siewert J. Marrink ◽  
Ignacio Faustino
Keyword(s):  
Force Field ◽  
Field Extension ◽  
Coarse Grained

THE RAMIFICATION GROUPS AND DIFFERENT OF A COMPOSITUM OF ARTIN–SCHREIER EXTENSIONS

2010 ◽  
Vol 06 (07) ◽  
pp. 1541-1564 ◽  
Author(s):  
QINGQUAN WU ◽  
RENATE SCHEIDLER
Keyword(s):  
Class Number ◽  
Function Field ◽  
Positive Characteristic ◽  
Field Extension ◽  
Constant Field ◽  
Divisor Class ◽  
Characteristic P ◽  
Similar Nature ◽  
Field Of Positive Characteristic ◽  
The Ideal

Let K be a function field over a perfect constant field of positive characteristic p, and L the compositum of n (degree p) Artin–Schreier extensions of K. Then much of the behavior of the degree pn extension L/K is determined by the behavior of the degree p intermediate extensions M/K. For example, we prove that a place of K totally ramifies/is inert/splits completely in L if and only if it totally ramifies/is inert/splits completely in every M. Examples are provided to show that all possible decompositions are in fact possible; in particular, a place can be inert in a non-cyclic Galois function field extension, which is impossible in the case of a number field. Moreover, we give an explicit closed form description of all the different exponents in L/K in terms of those in all the M/K. Results of a similar nature are given for the genus, the regulator, the ideal class number and the divisor class number. In addition, for the case n = 2, we provide an explicit description of the ramification group filtration of L/K.

Sign in / Sign up

Export Citation Format

Share Document