Computational and Symbolic Anonymity in an Unbounded Network
スポンサーリンク
概要
- 論文の詳細を見る
We provide a formal model for protocols using ring signatures and prove that this model is computationally sound: if there is an attack in the computational world, then there is an attack in the formal (abstract) model. Our original contribution is that we consider security properties, such as anonymity, which are not properties of a single execution trace, while considering an unbounded number of sessions of the protocol.
- The Japan Society for Industrial and Applied Mathematicsの論文
The Japan Society for Industrial and Applied Mathematics | 論文
- Computational and Symbolic Anonymity in an Unbounded Network
- Finite element computation for scattering problems of micro-hologram using DtN map
- A new compressible fluid model for traffic flow with density-dependent reaction time of drivers
- A new method for fast computation of cumulative distribution functions by fractional FFT
- Evolution of bivariate copulas in discrete processes