An extremely small and efficient identification scheme

This is a preprint of a book chapter published in Lecture Notes in Computer Science,1841, Springer-Verlag, Berlin (2000). The original publication is available at www.springerlink.com.We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications

Secure Sealed-Bid Online Auctions Using Discreet Cryptographic Proofs

Abstract This work describes the design and implementation of an auction system using secure multiparty computation techniques. Our aim is to produce a system that is practical under actual field constraints on computation, memory, and communication. The underlying protocol is privacy-preserving, that is, the winning bid is determined without information about the losing bids leaking to either the auctioneer or other bidders. Practical implementation of the protocol is feasible using circuit-based cryptographic proofs along with additively homomorphic bit commitment. Moreover, we propose the development of a Proof Certificate standard. These certificates convey sufficient information to recreate the cryptographic proofs and verify them offline

An extremely small and efficient identification scheme

We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications.7 page(s