Abstract. In this paper we present an attack on a reduced round version of Crypton. The attack is based on the dedicated Square attack. We explain why the attack also works on Cryp...
Carl D'Halluin, Gert Bijnens, Vincent Rijmen, Bart...
In this paper we consider the problem of efficiently locating cryptographic keys hidden in gigabytes of data, such as the complete file system of a typical PC. We describe efficie...
Abstract. We present a series of protocols for authenticating an individual’s membership in a group without revealing that individual’s identity and without restricting how the...
Stuart E. Schechter, Todd Parnell, Alexander J. Ha...
Abstract. Anonymity features of electronic payment systems are important for protecting privacy in an electronic world. However, complete anonymity prevents monitoring financial t...
We analyze “coin-wallet” and “balance-wallet” under partial real-time audit, and compute upper bounds on theft due to the fact that not all the transactions are audited in ...
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...
In this paper we discuss various aspects of cryptosystems based on hyperelliptic curves. In particular we cover the implementation of the group law on such curves and how to genera...
We examine the concurrent composition of zero-knowledge proofs. By concurrent composition, we indicate a single prover that is involved in multiple, simultaneous zero-knowledge pro...
Since the Diffie-Hellman paper, asymmetric encryption has been a very important topic, and furthermore ever well studied. However, between the efficiency of RSA and the security of...