The random oracle methodology, revisited (preliminary version)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
Theoretical Computer Science
The reactive simulatability (RSIM) framework for asynchronous systems
Information and Computation
Analyzing Security Protocols Using Time-Bounded Task-PIOAs
Discrete Event Dynamic Systems
On the Relationships between Notions of Simulation-Based Security
Journal of Cryptology
Relationship of Three Cryptographic Channels in the UC Framework
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
| Hi-index | 0.00 |
In this paper, the substitutability of the indifferentiability framework with non-sequential scheduling is examined by reformulating the framework through applying the Task-PIOA framework, which provides non-sequential activation with oblivious task sequences. First, the indifferentiability framework with non-sequential scheduling is shown to be able to retain the substitutability. Next, this framework is shown to be closely related to reducibility of systems. Finally, two modelings with respectively sequential scheduling and non-sequential scheduling are shown to be mutually independent. Thus, the importance of scheduling in the indifferentiability framework is clarified.