Card-based cryptography is a research field for realizing cryptographic protocols using a deck of physical cards. Shinagawa et al. proposed a regular n-sided polygon card, which can hold a value from 0 to $n-1$, and constructed an addition protocol ...$\mathbb{}\mathbb{}$$$$\mathbb{}\mathbb{}$$\frac{\mathrm{}}{}\mathrm{}$$\mathrm{}$$\frac{\mathrm{}}{}\mathrm{}$$$$$

Suppose that a sequence of $\mathit{n}$ cards, numbered 1 to $\mathit{n}$, is placed face up in random order. Let $\mathit{k}$ be the number on the first card in the sequence. Then take the first $\mathit{k}$ cards from the sequence, rearrange that subsequence of $\mathit{k}$ cards in reverse order, ...$\mathit{}\mathit{}$$\mathit{}$$\mathit{}\mathit{}$$\mathit{}\mathrm{}$$\mathit{}$$$$\mathit{}$$\mathit{}$$\mathit{}$$\mathit{}$

Card-based cryptography aims to realize secure multiparty computation with physical cards. This paper is the first to address Private Set Intersection (PSI) and Private Set Union (PSU) in card-based cryptography. PSI and PSU are well-studied ...

A pile-scramble shuffle is one of the most effective shuffles in card-based cryptography. Indeed, many card-based protocols are constructed from pile-scramble shuffles. This paper aims to study the power of pile-scramble shuffles. In particular, ...$\mathrm{}$$\mathrm{}$$\mathrm{}$

During the last years, several card-based Zero-Knowledge Proof (ZKP) protocols for Nikoli’s puzzles have been designed. Although there are relatively simple card-based ZKP protocols for a number of puzzles, such as Sudoku and Kakuro, some puzzles ...

Card-based cryptography is a variant of multi-party computation using physical cards like playing cards. There are two models on card-based cryptography, called public and private models. The public model assumes that all operations are executed ...$\mathrm{}$

Understanding the role of network for epidemic spread is a major concern in the study of complex network and disease spread. Localization of Principal EigenVector (PEV) of the network’s adjacency matrix has been explored in recent past by many ...

This paper addresses the problem of efficiently finding an optimal Bayesian network structure for maximizing the posterior probability. In particular, we focus on the B& B strategy to save the computational effort associated with finding the ...

We address the well-known score-based Bayesian network structure learning problem. Breadth-first branch and bound (BFBnB) has been shown to be an effective approach for solving this problem. Duplicate detection is an important component of the ...

Learning causal models hidden in the background of observational data has been a difficult issue. Dealing with latent common causes and selection bias for constructing causal models in real data is often necessary because observing all relevant ...

The second AMBN was held in Yokohama, Japan on November 16–18, 2015, co-sponsored by the Japanese Society Artificial Intelligence (JSAI) and the National Institute of Advanced Industrial Science and Technology (AIST).The AMBN workshop had over 100 ...

!-graphs provide a means of reasoning about infinite families of string diagrams and have proven useful in manipulation of (co)algebraic structures like Hopf algebras, Frobenius algebras, and compositions thereof. However, they have previously ...

At the heart of the Conway-Kochen Free Will Theorem and Kochen and Specker’s argument against non-contextual hidden variable theories is the existence of a Kochen-Specker (KS) system: a set of points on the sphere that has no {0,1}-coloring such ...

A novel approach to relational classification based on a Gaussian Random Field and random walks over the graph representing labeled and unlabeled examples is proposed in the paper. Additionally, a class homogeneity measure has been introduced. It ...

In classification problems, it is very common to have ordinal data in the variables, in both explanatory and class variables. When the class variable should increase according to a subset of explanatory variables, the problem must satisfy the ...

Pattern matching with wildcards and length constraints (PMWL) is a complex problem which has important applications in bioinformatics, network security and information retrieval. Existing algorithms use the traditional left-most strategy when ...

Keyword query processing over graph structured data is beneficial across various real world applications. The basic unit, of search and retrieval, in keyword search over graph, is a structure (interconnection of nodes) that connects all the query ...

Constraint-based search methods, which are a major approach to learning Bayesian networks, are expected to be effective in causal discovery tasks. However, such methods often suffer from impracticality of classical hypothesis testing for ...