K-Most Promising (K-MPP) product is a strategy for selecting a product that used in the process of determining the most demanded products by consumers. The basic computations used to perform K-MPP ...are two types of skyline queries: dynamic skyline and reverse skyline. K-MPP selection is done on the application layer, which is the last layer of the OSI model. One of the application layer functions is providing services according to the user's preferences.
In the K-MPP implementation, there exists the situation in which the manufacturer may be less satisfied with the query results generated by the database search process (why-not question), so they want to know why the database gives query results that do not match their expectations. For example, manufacturers want to know why a particular data point (unexpected data) appears in the query result set, and why the expected product does not appear as a query result. The next problem is that traditional database systems will not be able to provide data analysis and solution to answer why-not questions preferred by users.
To improve the usability of the database system, this study is aiming to answer why-not K-MPP and providing data refinement solutions by considering user feedback, so users can also find out why the result set does not meet their expectations. Moreover, it may help users to understand the result by performing analysis information and data refinement suggestion.
This paper presents an interesting new development in the area of chemical modification of PIM-1. The amide PIM-1 (named as PIM-CONH2) was synthesized by post-synthesis modification method using ...hydrogen peroxide (H2O2) as reagent at room temperature. The protocol enjoys mild reaction conditions, easy work-up procedure and high conversion yield (i.e. nearly 100% of nitrile group converts to corresponding amide group.) 13C NMR and FT-IR spectra indisputably confirmed that pure PIM-CONH2 was obtained with no traces of nitrile and carboxylic acid groups. The PIM-CONH2 conveys high solubility in polar aprotic solvents such as DMSO, DMF, and NMP. The fully-converted sample PIM-CONH2-24h possessed the apparent BET surface area of 527 m2 g−1, which is among the highest ever reported in various post-synthesis modified PIM-1 materials.
Display omitted
•Treatment of PIM-1 with H2O2 afforded the PIM-CONH2 with excellent yield and high purity.•The structure and properties of PIM-CONH2 was fully characterized by FT-IR, NMR, UV–Vis and BET surface area etc.•PIM-CONH2-24h possessed the apparent BET surface area of 527 m2 g−1 after methanol soaking treatment.
In this paper, we focus on verifiability of predicate encryption. A verifiable predicate encryption scheme guarantees that all legitimate receivers of a ciphertext will obtain the same message upon ...decryption. While verifiability of predicate encryption might be a desirable property by itself, we furthermore show that this property enables interesting applications.
Specifically, we provide two applications of verifiable predicate encryption. Firstly, we show that for a large class of verifiable predicate encryption schemes, it is always possible to convert a chosen-plaintext secure scheme into a chosen-ciphertext secure one. Secondly, we show that a verifiable predicate encryption scheme allows the construction of a deniable predicate authentication scheme. This primitive enables a user to authenticate a message to a verifier using a private key satisfying a specified relation while at the same time allowing the user to deny ever having interacted with the verifier. This scheme furthermore guarantees the anonymity of the user in the sense that the verifier will learn nothing about the user’s private key except that it satisfies the specified relation.
Lastly, we show that many currently known predicate encryption schemes already provide verifiability, and furthermore demonstrate that many predicate encryption schemes which do not provide verifiability, can be easily converted into schemes providing verifiability.
Our results not only highlight that verifiability is a very useful property of predicate encryption, but also show that efficient and practical schemes with this property can be obtained relatively easily.
We are interested in investigating the security of source encryption with a symmetric key under side-channel attacks. In this paper, we propose a general framework of source encryption with a ...symmetric key under the side-channel attacks, which applies to any source encryption with a symmetric key and any kind of side-channel attacks targeting the secret key. We also propose a new security criterion for strong secrecy under side-channel attacks, which is a natural extension of mutual information, i.e., the maximum conditional mutual information between the plaintext and the ciphertext given the adversarial key leakage, where the maximum is taken over all possible plaintext distribution. Under this new criterion, we successfully formulate the rate region, which serves as both necessary and sufficient conditions to have secure transmission even under side-channel attacks. Furthermore, we also prove another theoretical result on our new security criterion, which might be interesting in its own right: in the case of the discrete memoryless source, no perfect secrecy under side-channel attacks in the standard security criterion, i.e., the ordinary mutual information, is achievable without achieving perfect secrecy in this new security criterion, although our new security criterion is more strict than the standard security criterion.
GPS is an efficient identification (ID) scheme based on Schnorr ID scheme designed for applications where low cost devices with limited resources are used and a very-short authentication time is ...required. Let P and V be a prover and a verifier in GPS and be a multiplicative group. P holds a secret key s ∈ 0, S) and publishes I = g-s. In each elementary round: (1) P sends to V x = gr where r is chosen randomly from 0, A), (2) V sends to P a random c ∈ 0, B), and (3) P sends y = r + cs (no modulus computation). Since there is no modular reduction on y, a key issue is whether GPS leaks information about s. It has been proved that GPS is statistical zero-knowledge, if in asymptotic sense, $\\ell$BS/A is negligible, where $\\ell$ is the number of elementary rounds in one complete identification trial. In this paper, first we will show the followings. (1) We can construct a concrete attack procedure which reveals one bit of secret key s from the specified value range of y unless BS/A is negligible. We reconfirm that we must set A extremely large compared to BS. (2) This drawback can be avoided by modifying GPS into a new scheme, GPS+., in which P does not send the value of y in the specified range where y reveals some information about s. GPS+ ensures perfect ZK only by requiring both A > BS and A being a multiple of the order of g, while it allows an honest P to be rejected with probability at most BS/(2A) in one elementary round. Under the standard recommended parameters for 80-bit security where $\\ell$ = 1, |S| = 160, and |B| = 35, |A| = 275 is recommended for GPS in GPS' paper. On the other hand, GPS+ can guarantee 80-bit security and less than one false rejection on average in 100 identifications with only |A| = 210 with the same parameters as above. In practice, this implies 275-210 = 65 bits (≈ 24%) reductions on storage requirement. We have confirmed that the reduce of A also reduces approximately 4% of running time for online response using a certain implementation technique for GPS+ by machine experiment.
Abstrak — Keamanan informasi merupakan bagian dari sebuah sistem yang sangat penting untuk dijaga validitas dan integritas data serta menjamin ketersediaan layanan bagi penggunaannya. Sistem keamanan ...informasi harus dilindungi dari segala macam serangan dan usaha-usaha penyusupan atau pemindaian oleh pihak yang tidak berhak. Salah satu mekanisme yang dapat diterapkan dalam meningkatkan keamanan informasi adalah dengan menggunakan firewall. Firewall merupakan sebuah mekanisme pengamanan yang dilakukan dengan cara melakukan kegiatan penyaringan paket data yang masuk dan keluar jaringan. Sehingga untuk dapat mengelola keamanan informasi dengan baik, maka dibutuhkan suatu tata kelola TI. Salah satu tata kelola TI yang dimaksud adalah berupa penyusunan panduan pengelolaan keamanan informasi. Penelitian ini bertujuan untuk membuat sebuah refrensi keamanan informasi berupa panduan pengelolaan keamanan informasi untuk firewall configuration yang mengacu pada standar PCI DSS v.3.1 dan COBIT 5. Penyusunan panduan pengelolaan keamanan informasi untuk firewall configuration dilakukan dalam empat tahap. Tahap pertama adalah penyusunan prosedur pengelolaan keamanan informasi untuk firewall configuration yang terdiri dari tahap analisis pemetaan proses, tahap penyusunan prosedur dan tahap penentuan peran dan deskripsi kerja. Tahap kedua adalah tahap verifikasi panduan pengelolaan keamanan informasi yang dilakukan melalui pemberian kuesioner penilaian. Verifikasi dilakukan dengan mengambil studi kasus di DSIK Universitas Airlangga dan dilakukan tanpa adanya penyesuaian atau spesifikasi terhadap DSIK Universitas Airlangga. Tahap ketiga adalah tahap perbaikan panduan pengelolaan keamanan informasi. Tahap perbaikan ini dilakukan untuk memperbaiki kekurangan yang dihasilkan saat verifikasi. Hasil penelitian ini berupa panduan pengelolaan keamanan informasi untuk firewall configuration. Hasil verifikasi menunjukkan bahwa sebanyak 42,86% responden menyatakan panduan pengelolaan yang dibuat, secara operasional sangat mudah untuk dilaksanakan.Kata Kunci — Assessment, COBIT 5, Keamanan Sistem Informasi, PCI DSS v.3.1, Panduan Pengelolaan.
We present a new methodology for constructing an efficient identification scheme, and based on it, we propose a lightweight identification scheme whose computational and storage costs are ...sufficiently low even for cheap devices such as RFID tags. First, we point out that the efficiency of a scheme with statistical zero-knowledgeness can be significantly improved by enhancing its zero-knowledgeness to perfect zero-knowledge. Then, we apply this technique to the Girault-Poupard-Stern (GPS) scheme which has been standardized by ISO/IEC. The resulting scheme shows a perfect balance between communication cost, storage cost, and circuit size (computational cost), which are crucial factors for implementation on RFID tags. Compared to GPS, the communication and storage costs are reduced, while the computational cost is kept sufficiently low so that it is implementable on a circuit nearly as small as GPS. Under standard parameters, the prover's response is shortened 80 bits from 275 bits to 195 bits and in application using coupons, storage for one coupon is also reduced 80 bits, whereas the circuit size is estimated to be larger by only 335 gates. Hence, we believe that the new scheme is a perfect solution for fast authentication of RFID tags.
Bencana bisa disebabkan oleh faktor alam, non alam, serta faktor manusia sehingga mengakibatkan timbulnya korban jiwa manusia, kerusakan lingkungan, kerugian harta benda, dan dampak psikologis. ...Efikasi diri yang baik bagi perawat berpotensi meningkatkan kesiapsiagaan terhadap bencana. Penelitian ini bertujuan untuk menguji hubungan antara efikasi diri dengan kesiapsiagaan bencana pada perawat rumah sakit. Penelitian ini berdesain deskriptif korelasional dengan pendekatan cross-sectional. Teknik convenience sampling diterapkan untuk merekrut 152 perawat dari sebuah rumah sakit umum di Provinsi Sulawesi Tengah, Indonesia. Kuesioner yang digunakan: General Self Efficacy (GSE) dan Disaster Preparedness Evaluation Tool (DPET). Korelasi Rank Spearman digunakan untuk menguji hubungan antar variabel. Tidak terdapat hubungan signifikan antara efikasi diri dengan kesiapsiagaan bencana (r=0,213; p=0,102). Efikasi diri perawat tergolong tinggi, sedangkan kesiapsiagaan perawat berada pada level sedang. Secara umum, efikasi diri tidak berkontribusi signifikan terhadap kesiapsiagaan bencana perawat rumah sakit. Minimnya pengalaman kebencanaan sangat berpotensi menjadi hal yang memediasi kepercayaan diri perawat terhadap kesiapsiagaan bencana. Konsistensi keyakinan perawat dalam usaha menghadapi tantangan dan kesulitan terkait kebencanaan perlu dipertahankan, namun dibutuhkan juga peningkatan kemampuan mendapatkan ide lebih banyak dalam penyelesaiannya. Intervensi efektif guna meningkatkan kesiapsiagaan bencana seperti pelatihan dan simulasi rutin sangat direkomendasikan.
Framework Convention on Tobacco Control (FCTC) is an international treaty for tobacco control efforts for world health under the WHO. Indonesia has not ratified the treaty as far as the impact that ...would be acceptable for Indonesia, while many countries in the world have ratified and observed what steps should be taken in the case of the strategic Indonesia. Keywords: Impact, Ratification, Framework Convention On Tobacco Control
PDF
