Bid opening in sealed-bid e-auction is efficient when a homomorphic encryption algorithm is employed to seal the bids and homomorphic bid opening is employed to open the bids. Such e-auction schemes are called homomorphic auctions. However, high efficiency of homomorphic auctions is based on an assumption: the bids are valid (e.g. within a special range). An undetected invalid bid can compromis...

This paper presents applications of the trope of the locked and sealed piggy-bank into which the secret can be easily inserted but from which it cannot be withdrawn without opening the box. We present a basic two-pass cryptographic scheme that can serve as template for a variety of implementations. Together with the sealed piggy-bank is sent a coded letter that lists and certifies the contents ...

In a multi-secret sharing scheme, several secret values are distributed among a set of n participants.In 2000 Chien et al.'s proposed a (t; n) multi-secret sharing scheme. Many storages and publicvalues required in Chien's scheme. Motivated by these concerns, some new (t; n) multi-secret sharingschemes are proposed in this paper based on the Lagrange interpolation formula for polynomials andcip...

secret is one of the key notions in studying the content of ibn 'arabi's mysticism. secret is a divine bounty which conferred upon the creatures by god and indicates a path stretching byond the reason. as an extension of secret god can be experienced by the mystic. of course undestanding god is a matter of faith and intuition and does not fit the medium of reason. the limits of langua...

meaning is both the reference and the content and their concomitant mental associations. the current research aims to find the meaning of home and its constituents in the everyday life of house residents. in this perspective, we seek to investigate this meaning-making processes through exploring the represented houses in four iranian movies in tehran. therefore, “freeway”, “sealed secret”, “sa’...

Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...

in a multi-secret sharing scheme, several secret values are distributed among a set of n participants.in 2000 chien et al.'s proposed a (t; n) multi-secret sharing scheme. many storages and publicvalues required in chien's scheme. motivated by these concerns, some new (t; n) multi-secret sharingschemes are proposed in this paper based on the lagrange interpolation formula for polynomials andcip...

In this paper, we provide an alternative explanation for why auctioneers often keep the reserve price hidden or secret. We consider a standard independent private values environment in which the buyers are risk-averse and the seller has private information about her valuation of the object to be auctioned. The seller uses a Þrst-price sealed-bid auction mechanism combined with either an announc...

In this paper we describe several fault attacks on the Advanced Encryption Standard (AES). First, using optical fault induction attacks as recently publicly presented by Skorobogatov and Anderson [SA], we present an implementation independent fault attack on AES. This attack is able to determine the complete 128-bit secret key of a sealed tamper-proof smartcard by generating 128 faulty cipher t...