Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...
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 ...
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes bas...
Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-...
Commitments model important aspects of agent interactions, especially those arising in e-business. A small number of patterns of commitments accommodate a variety of realistic int...
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...