Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
Abstract: Cryptographic protocols are successfully analyzed using formal methods. However, formal approaches usually consider the encryption schemes as black boxes and assume that ...
What distinguishes e-commerce from ordinary commerce? What distinguishes it from distributed computation? In this paper we propose a performative theory of e-commerce, drawing on ...
We give a new, simulation-based, definition for security in the bounded-quantum-storage model, and show that this definition allows for sequential composition of protocols. Damg...
Building conversation protocols has traditionally been an art more than a science, as their construction is often guided by designers’ intuition rather than by a principled appro...