The following pages link to Yoshifumi Manabe (Q504213):
Displayed 20 items.
- On compositional reasoning about anonymity and privacy in epistemic logic (Q504214) (← links)
- Fault-tolerant routings in a \(\kappa\)-connected network (Q1109755) (← links)
- \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion (Q1127529) (← links)
- Global conditions in debugging distributed programs (Q1200136) (← links)
- \((h,k)\)-arbiters for \(h\)-out-of-\(k\) mutual exclusion problem (Q1884984) (← links)
- Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II (Q1917254) (← links)
- A three-player envy-free discrete division protocol for mixed manna (Q2038349) (← links)
- Card-based cryptographic protocols for three-input functions using private operations (Q2115886) (← links)
- Card-based cryptographic protocols with a standard deck of cards using private operations (Q2119979) (← links)
- An optimistic fair exchange protocol and its security in the universal composability framework (Q2379119) (← links)
- Universally Composable Identity-Based Encryption (Q2876988) (← links)
- A Secure M + 1st Price Auction Protocol Based on Bit Slice Circuits (Q3097998) (← links)
- Meta-Envy-Free Cake-Cutting Protocols (Q3586108) (← links)
- An Efficient Anonymous Credential System (Q3603014) (← links)
- (Q3827948) (← links)
- Efficient Concurrent Oblivious Transfer in Super-Polynomial-Simulation Security (Q4912413) (← links)
- Relationship of Three Cryptographic Channels in the UC Framework (Q5505476) (← links)
- Theory of Cryptography (Q5711656) (← links)
- Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol (Q5746344) (← links)
- Card-based zero-knowledge proof for the nearest neighbor property: zero-knowledge proof of ABC end view (Q6112013) (← links)