Veidruste Otsing

Wednesday, April 29, 2015

kanepiõli, kanep, (kuid siin mainitu on kõigest üks võimalus paljudest, oleneb kas kardad raha kaotada või mitte, sest kõik ka kohale ei jõua..)

Hello Joakim,
Thanks for your interest in our products.
We got some quality Medical marijuana (Sativa/Indica strains) ,seeds,
and some hash/Hash Oil for sale.

We can ship a maximum of 5lbs to Estonia and a minimum of 30grams. We
have been shipping to the E.U and we have a highly guaranteed delivery
success.

We offer discreet packaging and we ship World wide from PA & DE , USA .
Our patient member information is secured in accordance with
doctor-patient confidentiality laws (HIPPA compliant). Your privacy is
our top priority and will never be shared.

Below is our promo price list for medicinal marijuana;

Medicinal Marijuana;
30 grams
30g White Widow : $210
30g Green Crack : 210
30g Hawaii-Skunk : $205
30g Super Skunk : $215
30g Sour diesel : $220
30g Hindu Kush : $200
30g Super Silver Haze : $215
30g OG Kush : $220
30g AK 47 : $200
30g Blueberry : $195
30g Trainreck is : $195
30g Jack herer : $230
30g white Rhino : $210
30g purple haze : $195


50grams
50g White Widow : $330
50g Green Crack : 330
50g Hawaii-Skunk : $315
50g Super Skunk : $375
50g Sour diesel : $340
50g Hindu Kush : $355
50g Super Silver Haze : $365
50g OG Kush : $365
50g AK 47 : $325
50g Blueberry : $345
50g Trainreck is : $345
50g Jack herer : $355
50g white Rhino : $330
50g purple haze : $345

1Pound( 1lbs)
1Lbs white widow : $2050
1lbs  Green Crack : $2150
1lbs Hawaii-Skunk : $2100
1lbs Super Skunk : $2250
1Lbs Sour diesel : $2100
1Lbs Ak47 : $1950
1Lbs Blueberry : $2100
1Lbs purple haze : $1900
1Lbs Super Silver haze : $2150
1Lbs Trainreck is : $1900
1Lbs white widow : $2100
1Lbs OG Kush : $2000
1Lbs White rhino : $2400
1Lbs Jack herer : $2600


(JUST TO NAME A FEW)

Shipping cost: $45 (Fast Express overnight delivery / Tracking number provided)
Special Offer : FREE SHIPPING FOR ORDERS ABOVE $500

Payment mode:We accept payment via Western union Or Money Gram .

How delivery works: We are located in Wilmington, DE. We do overnight
shipment via Fedex Courier Service Or UPS and The Agency provides
Tracking Number for any delivery so clients can track their parcel to
know the present statues and arrival time. We ensure that all packages
are shipped with maximum discretion to all our client , So your parcel
will be register as a discreet parcel so the Custom don't get involve.
Your parcel will be drop at the location you will provide to us.

You'll start by sending to us the funds needed as per your order.
Everything will be discreet and this is the reason why you are making
the payment  via Western Union Or Money-Gram wire transfer.


What we will like to let you know is that we have been online
suppliers of meds for years now and all our clients do receive what
they have ordered in the right quality and proportion. We do offer
discounts to all our meds reason being that we help people online who
are not able to afford a doctor or buy from pharmacies
 .
So just send to us a reply once you revise the prices, Ok.

Note: HOPE YOU NOT A MEMBER OF THE LAW
ENFORCEMENT? DO NOT EVEN BOTHER
TRACKING US DOWN IF YOU ARE A MEMBER OF THE LAW ENFORCEMENT, OK

Waiting your soonest reply
---------
Greetings, this is nice and proper.
Can You send me the active oil or hash price list, and some seeds, as am thinking this to be more compact, better for many reasons like for eating.

---------


Hello,
   Thanks for getting back to us. We do not sell seeds but below are some of the oils we have in stock:

OIL
Hash Oil = $40 per Gram
Best Offer :- 5g = $180

Shatter Oil = $45 per Gram

Cannabis Butter = $35 per Gram
Best Offer :- 5g = $160

WAX
30grams = $290

So we also do our business with new clients discreetly and after this first business deal, we will like to have a long term business relationship with you.
So kindly get back to us with your order and shipping details so that we can proceed.

----------

Greetings again,
Should have asked it on first mail but how to compare or get to know what is the potency of the oil,wax,butter maybe compared to something.. and are they usually made from what kind of pants, Sativa, Indica ?

As we use spiritually and medically it is important for us.

I really wish there to be more people with profession of providing what you offer. This is great service for the Earth. 


Armastusega,
Margus

-----------

Hi Mr. Margus ,

Of course we are professionals and we shall answer your questions, Ok.
Below are some review of our wax , cannabis oil and Butter ;

WAX::
Type: Indica
Potency: Perfect 100/100. Massive Potency (Not for the faint of heart.
Good For: Pain Reliever, Muscle Relaxer, Energy Boost, Focus, Insomnia, Sleep, and bewildering dreams.

CANNABIS OIL::
Type: Sativa
Potency: Best medible to date ; 30 min in w/ empty stomach hits hard
Good For: Just about any situation requiring pain relief and staying awake; like Excedrin but better

BUTTER::
Type: Sativa/Indica
Potency: 9.5 out of 10
Good For: Nighttime, relaxing, movies, hanging out with special folks, meditating(with small doses only)taking a bath conversation, in small amounts one could float thru a day and fun for in the bedroom too ‘wink’


We hope we did answer your questions correctly.  We expect to read from you soon.

Thanks

Thursday, April 23, 2015

Tatsuaki Okamoto

  1. Chapter

    Universal Electronic Cash

    This paper proposes the first ideal untraceable electronic cash system which solves the most crucial problem inherent with real cash and all previous untraceable electronic cash systems. The main advantage of ...
     Download:


    1. Chapter

      An Efficient Divisible Electronic Cash Scheme

      Recently, several “divisible” untraceable off-line electronic cash schemes have been presented [8, 11, 19, 20]. This paper presents the first practical “divisible” untraceable1 off-line cash scheme that is “singl...
    2. Chapter

      Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs

      This paper presents two transformations of public-coin/Arthur-Merlin proof systems which are zero-knowledge with respect to the honest verifier into (public-coin/Arthur-Merlin) proof systems which are zero-knowle...

    Packing Messages and Optimizing Bootstrapping in GSW-FHE

    We construct the first fully homomorphic encryption (FHE) scheme that encrypts matrices and supports homomorphic matrix addition and multiplication. This is a natural extension of packed FHE and thus supports mor...
  2. No Access
    Chapter

    Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol

    We present the first general MPC protocol that satisfies the following: (1) the construction is black-box, (2) the protocol is universally composable in the plain model, and (3) the number of rounds is constan...
  3. No Access
    Chapter

    Decentralized Attribute-Based Signatures

    We present the first decentralized multi-authority attribute-based signature (DMA-ABS) scheme, in which no central authority and no trusted setup are required. The proposed DMA-ABS scheme for a large class of (no...
  4. No Access
    Article

    Secure Integration of Asymmetric and Symmetric Encryption Schemes

    This paper presents a generic conversion from weak asymmetric and symmetric encryption schemes to an asymmetric encryption scheme that is chosen-ciphertext secure in the random oracle model. Our conversion is ...
  5. No Access
    Chapter

    Fully Secure Unbounded Inner-Product and Attribute-Based Encryption

    In this paper, we present the first inner-product encryption (IPE) schemes that are unbounded in the sense that the public parameters do not impose additional limitations on the predicates and attributes used for...
  6. No Access
    Chapter

    Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption

    This paper proposes the first inner product encryption (IPE) scheme that is adaptively secure and fully attribute-hiding (attribute-hiding in the sense of the definition by Katz, Sahai and Waters), while the e...
  7. No Access
    Chapter

    Efficient Concurrent Oblivious Transfer in Super-Polynomial-Simulation Security

    In this paper, we show a concurrent oblivious transfer protocol in super-polynomial-simulation (SPS) security. Our protocol does not require any setup and does not assume any independence among the inputs. In ...
  8. No Access
    Chapter

    A Secure M + 1st Price Auction Protocol Based on Bit Slice Circuits

    This paper presents an efficient secure auction protocol for M + 1st price auction. In our proposed protocol, bidding prices are represented as binary numbers. Thus, when the bidding price is an integer up to p a...
  9. No Access
    Chapter

    Some Key Techniques on Pairing Vector Spaces

    Recently we have introduced a new concept on bilinear pairing groups, dual pairing vector spaces (DPVS). Although we have already enjoyed the merits of DPVS in our results [1,2,3,4,5], we here explain them more e...
  10. Chapter

    Efficient Attribute-Based Signatures for Non-monotone Predicates in the Standard Model

    This paper presents a fully secure (adaptive-predicate unforgeable and private) attribute-based signature (ABS) scheme in the standard model. The security of the proposed ABS scheme is proven under standard assum...
  11. No Access
    Chapter

    Achieving Short Ciphertexts or Short Secret-Keys for Adaptively Secure General Inner-Product Encryption

    In this paper, we present two non-zero inner-product encryption (NIPE) schemes that are adaptively secure under a standard assumption, the decisional linear (DLIN) assumption, in the standard model. One of the pr...
  12. No Access
    Chapter

    Efficient Secure Auction Protocols Based on the Boneh-Goh-Nissim Encryption

    This paper presents efficient secure auction protocols for first price auction and second price auction. Previous auction protocols are based on a generally secure multi-party protocol called mix-and-match pro...
  13. No Access
    Chapter

    Meta-Envy-Free Cake-Cutting Protocols

    This paper discusses cake-cutting protocols when the cake is a heterogeneous good that is represented by an interval in the real line. We propose a new desirable property, the meta-envy-freeness of cake-cuttin...
  14. Chapter

    Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption

    We present two fully secure functional encryption schemes: a fully secure attribute-based encryption (ABE) scheme and a fully secure (attribute-hiding) predicate encryption (PE) scheme for inner-product predic...
  15. Chapter

    Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption

    This paper presents a fully secure functional encryption scheme for a wide class of relations, that are specified by non-monotone access structures combined with inner-product relations. The security is proven...
  16. No Access
    Chapter

    An eCK-Secure Authenticated Key Exchange Protocol without Random Oracles

    This paper presents a (PKI-based) two-pass authenticated key exchange (AKE) protocol that is secure in the extended Canetti-Krawczyk (eCK) security model. The security of the proposed protocol is proven withou...
  17. Chapter

    Compact CCA-Secure Encryption for Messages of Arbitrary Length

    This paper proposes a chosen-ciphertext secure variant of the ElGamal public-key encryption scheme which generates very compact ciphertexts for messages of arbitrary length. The ciphertext overhea...
  18. Chapter

    Hierarchical Predicate Encryption for Inner-Products

    This paper presents a hierarchical predicate encryption (HPE) scheme for inner-product predicates that is secure (selectively attribute-hiding) in the standard model under new assumptions. These assumptions ar...
  19. No Access
    Chapter

    An Efficient Anonymous Credential System

    This paper presents an efficient anonymous credential system that includes two variants. One is a system that lacks a credential revoking protocol, but provides perfect anonymity-unlinkability and computationa...
  20. No Access
    Chapter

    Homomorphic Encryption and Signatures from Vector Decomposition

    This paper introduces a new concept, distortion eigenvector space; it is a (higher dimensional) vector space in which bilinear pairings and distortion maps are available. A distortion eigenvector space can be eff...
  1. Chapter

    Relationship of Three Cryptographic Channels in the UC Framework

    The relationship of three cryptographic channels, secure channels (SC), anonymous channels (AC) and direction-indeterminable channels (DIC), was investigated by Okamoto. He showed that the three cryptographic ...
  2. Chapter

    Chosen Ciphertext Security with Optimal Ciphertext Overhead

    Every public-key encryption scheme has to incorporate a certain amount of randomness into its ciphertexts to provide semantic security against chosen ciphertext attacks (IND-CCA). The difference between the le...
  3. No Access
    Book
    Formal Correctness of Security Protocols
  4. No Access
    Book
    Cryptology and Network Security

    Cryptology and Network Security

    6th International Conference, CANS 2007, Singapore, December 8-10, 2007. Proceedings
  5. No Access
    Book
    Introduction to Cryptography
  6. No Access
    Book
    Pairing-Based Cryptography – Pairing 2007

    Pairing-Based Cryptography – Pairing 2007

    First International Conference, Tokyo, Japan, July 2-4, 2007. Proceedings
  7. No Access
    Book
    Public Key Cryptography – PKC 2007

    Public Key Cryptography – PKC 2007

    10th International Conference on Practice and Theory in Public-Key Cryptography Beijing, China, April 16-20, 2007. Proceedings
  8. Chapter

    Authenticated Key Exchange and Key Encapsulation in the Standard Model

    This paper introduces a new paradigm to realize various types of cryptographic primitives such as authenticated key exchange and key encapsulation in the standard model under three standard assumptions: the de...
  9. No Access
    Book
    Concurrent Zero-Knowledge

    Concurrent Zero-Knowledge

    With Additional Background by Oded Goldreich
  10. No Access
    Chapter

    Cryptography Based on Bilinear Maps

    The bilinear mapping technique that uses the (Weil and Tate) pairings over elliptic (or hyperelliptic) curves represents a great breakthrough in cryptography. This paper surveys this new trend in cryptography,...
  11. No Access
    Chapter

    On Pairing-Based Cryptosystems

    The pairing technique that uses the (Weil and Tate) pairings over elliptic (or hyperelliptic) curves represents a great breakthrough in cryptography. This paper surveys this new trend in cryptography, and emph...
  12. No Access
    Chapter

    Universally Composable Identity-Based Encryption

    Identity-based encryption (IBE) is one of the most important primitives in cryptography, and various security notions of IBE (e.g., IND-ID-CCA2, NM-ID-CCA2, IND-sID-CPA etc.) have been introduced. The relation...
  13. Chapter

    Efficient Blind and Partially Blind Signatures Without Random Oracles

    This paper proposes a new efficient signature scheme from bilinear maps that is secure in the standard model (i.e., without the random oracle model). Our signature scheme is more effective in many applications...
  14. Chapter

    A Universally Composable Secure Channel Based on the KEM-DEM Framework

    For ISO standards on public-key encryption, Shoup introduced the framework of KEM (Key Encapsulation Mechanism), and DEM (Data Encapsulation Mechanism), for formalizing and realizing one-directional hybrid encryp...
  15. No Access
    Article

    RSA-OAEP Is Secure under the RSA Assumption

    Recently Victor Shoup noted that there is a gap in the widely believed security result of OAEP against adaptive chosen-ciphertext attacks. Moreover, he showed that, presumably, OAEP cannot be proven secure fro...
  16. No Access
    Book
    Topics in Cryptology – CT-RSA 2004

    Topics in Cryptology – CT-RSA 2004

    The Cryptographers’ Track at the RSA Conference 2004, San Francisco, CA, USA, February 23-27, 2004, Proceedings
  17. Chapter

    An RSA Family of Trap-Door Permutations with a Common Domain and Its Applications

    Bellare, Boldyreva, Desai, and Pointcheval [1] recently proposed a new security requirement of the encryption schemes called “key-privacy.” It asks that the encryption provide (in addition to privacy of the da...
  18. No Access
    Book
    Protocols for Authentication and Key Establishment
  19. Chapter

    Almost Uniform Density of Power Residues and the Provable Security of ESIGN

    ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the methodology of provable security. A secu...
  20. No Access
    Book
    The Design of Rijndael

    The Design of Rijndael

    AES — The Advanced Encryption Standard
  1. Book
    Introduction to Cryptography
  2. No Access
    Book
    Information and Communications Security

    Information and Communications Security

    Third International Conference, ICICS 2001 Xian, China, November 13–16, 2001 Proceedings
  3. Chapter

    RSA-OAEP Is Secure under the RSA Assumption

    Recently Victor Shoup noted that there is a gap in the widely-believed security result of OAEP against adaptive chosen-cipher-text attacks. Moreover, he showed that, presumably, OAEP cannot be proven secure fr...
  4. Chapter

    The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes

    This paper introduces a novel class of computational problems, the gap problems, which can be considered as a dual to the class of the decision problems. We show the relationship among inverting problems, decisio...
  5. No Access
    Chapter

    REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform

    Seven years after the optimal asymmetric encryption padding (OAEP) which makes chosen-ciphertext secure encryption scheme from any trapdoor one-way permutation (but whose unique application is RSA), this paper...
  6. No Access
    Book
    Advances in Cryptology — ASIACRYPT 2000

    Advances in Cryptology — ASIACRYPT 2000

    6th International Conference on the Theory and Application of Cryptology and Information Security Kyoto, Japan, December 3–7, 2000 Proceedings
  7. Chapter

    Quantum Public-Key Cryptosystems

    This paper presents a new paradigm of cryptography, quantum public-key cryptosystems. In quantum public-key cryptosystems, all parties including senders, receivers and adversaries are modeled as quantum (proba...
  8. Chapter

    Provably Secure Partially Blind Signatures

    Partially blind signature schemes are an extension of blind signature schemes that allow a signer to explicitly include necessary information (expiration date, collateral conditions, or whatever) in the result...
  9. Chapter

    A Signature Scheme with Message Recovery as Secure as Discrete Logarithm

    This paper, for the first time, presents a provably secure signature scheme with message recovery based on the (elliptic-curve) discrete logarithm. The proposed scheme can be proven to be secure in the strongest ...
  10. No Access
    Chapter

    How to Enhance the Security of Public-Key Encryption at Minimum Cost

    This paper presents a simple and efficient conversion from a semantically secure public-key encryption scheme against passive adversaries to a non-malleable (or semantically secure) public-key encryption scheme a...
  11. No Access
    Chapter

    An Improvement on a Practical Secret Voting Scheme

    This paper improves voters’ convenience in the secret-ballot voting scheme offered by Fujioka, Ohta and Okamoto. In their scheme, all voters have to participate in all stages of the voting scheme; that is, the...
  12. No Access
    Chapter

    Delegation Chains Secure Up to Constant Length

    In this paper we discuss how one can delegate his power to authenticate or sign documents to others who, again, can delegate the power to someone else. A practical cryptographic solution would be to issue a ce...
  13. Chapter

    Secure Integration of Asymmetric and Symmetric Encryption Schemes

    This paper shows a generic and simple conversion from weak asymmetric and symmetric encryption schemes into an asymmetric encryption scheme which is secure in a very strong sense — indistinguishability against...
  14. Chapter

    A new public-key cryptosystem as secure as factoring

    This paper proposes a novel public-key cryptosystem, which is practical, provably secure and has some other interesting properties as follows: 1. ...
  15. Chapter

    Security of an identity-based cryptosystem and the related reductions

    Recently an efficient solution to the discrete logarithm problem on elliptic curves over Fp with p points (p: prime), so-called anomalous curves, was independently discovered by Semaev [14], Smart [17], and Satoh...
  16. No Access
    Chapter

    Lower bounds on term-based divisible cash systems

    Electronic cash is one of the most important applications of public-key cryptosystems. This paper gives lower bounds for data size and computational complexity of divisible electronic cash based on the Chaum-F...
  17. No Access
    Chapter

    Receipt-free electronic voting schemes for large scale elections

    This paper proposes practical receipt-free voting schemes which are suitable for (nation wide) large scale elections. One of the proposed scheme requires the help of the voting commission, and needs a physical...
  18. No Access
    Chapter

    Threshold key-recovery systems for RSA

    Although threshold key-recovery systems for the discrete log based cryptosystems such as the ElGamal scheme have been proposed by Feldman and Pedersen [6, 11, 12], no (practical) threshold key-recovery system ...
  19. Chapter

    On concrete security treatment of signatures derived from identification

    Signature schemes that are derived from three move identification schemes such as the Fiat-Shamir, Schnorr and modified ElGamal schemes are a typical class of the most practical signature schemes. The random o...
  20. Chapter

    A practical and provably secure scheme for publicly verifiable secret sharing and its applications

    A publicly verifiable secret sharing (PVSS) scheme, named by Stadler in [Sta96], is a special VSS scheme in which anyone, not only the shareholders, can verify that the secret shares are correctly distributed....
  1. Chapter

    Statistical zero knowledge protocols to prove modular polynomial relations

    This paper proposes a bit commitment scheme, BC(·), and efficient statistical zero knowledge (in short, SZK) protocols in which, for any given multi-variable polynomial f(X 1,..,X t) a...
  2. No Access
    Chapter

    Practical escrow cash systems

    This paper proposes practical escrow cash schemes with the following properties: The privacy of users is preserved, unless all (or a certain portion) of the trustees collaborate...
  3. Chapter

    Keeping the SZK-verifier honest unconditionally

    This paper shows that using direct properties of a zero-knowledge protocol itself, one may impose a honest behavior on the verifier (without additional cryptographic tools). The main technical contribution is ...
  4. No Access
    Chapter

    An electronic voting scheme

    This paper proposes a practical large scaled secret voting scheme which satisfies the receipt-free property* as well as the fairness property†. This scheme uses three realistic tools: a non-anonymous channel, a b...
  5. Chapter

    Single-term divisible electronic coins

    In the literature, only one “divisible” off-line electronic cash scheme has been presented [OO91]. In this paper, we present the construction of more efficient “divisible” off-line electronic coin schemes that...
  6. No Access
    Chapter

    Zero-knowledge proofs of computational power in the shared string model

    Zero-knowledge proofs have several applications and come in three different flavors: to prove membership to a language [13]; to prove possession of knowledge [13, 10, 12, 16, 3]; and to prove computational pow...
  7. Chapter

    On Key Distribution and Authentication in Mobile Radio Networks

    Mobile communication networks need public key cryptosystems that offer both low computation cost and user authentication. Tatebayashi et al. showed such a key distribution protocol for such networks at CRYPTO’...
  8. Chapter

    Designated Confirmer Signatures and Public-Key Encryption are Equivalent

    The concept of designated confirmer signatures was introduced by Chaum [Cha94] to improve a shortcoming of undeniable signatures. The present paper formalizes the definition of designated confirmer signatures and...
  9. No Access
    Chapter

    A practical secret voting scheme for large scale elections

    This paper proposes a practical secret voting scheme for large scale elections. The participants of the scheme are voters, an administrator, and a counter. The scheme ensures the privacy of the voters even if ...
  10. Chapter

    An Efficient Digital Signature Scheme Based on an Elliptic Curve over the Ring Z n

    We propose a practical digital signature scheme based on the elliptic curve modulo n, where n = p 2 q such that p and q are large secret primes. The signature generation speed of o...
  11. No Access
    Chapter

    A digital multisignature scheme based on the Fiat-Shamir scheme

    We show the sequential multisignature scheme based on the Fiat-Shamir scheme which is a slight variant of simultaneous multisignature scheme, and discuss the security of a digital multisignature scheme. The fo...
  12. Chapter

    How Intractable Is the Discrete Logarithm for a General Finite Group?

    GDL is the discrete logarithm problem for a general finitc group G. This paper gives a characterization for the intractability of GDL from the viewpoint of computational complexity theory. It is shown that GDL ∈ ...
  13. No Access
    Chapter

    On the relationship among cryptographic physical assumptions

    Although the equivalence of some cryptographic computational assumptions (e.g., the existence of one-way functions, that of pseudo-random generators, and that of secure signature schemes) has been studied extensi...
  14. Chapter

    Secure Bit Commitment Function against Divertibility

    Some zero-knowledge interactive proofs (ZKIPs) have divertibility, that is, evidence of proof issued by a genuine prover, A, can be transferred to plural verifiers, B and then C, where the intermediate verifier,
  15. No Access
    Chapter

    An extension of zero-knowledge proofs and its applications

    This paper presents an extension (or relaxation) of zero-knowledge proofs, called oracle-simulation zero-knowledge proofs. It is based on a new simulation technique, called no-knowledge-release-oracle simulation,...
  16. Chapter

    Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes

    This paper presents a three-move interactive identification scheme and proves it to be as secure as the discrete logarithm problem. This provably secure scheme is almost as efficient as the Schnorr identificat...
  17. Chapter

    New Public-Key Schemes Based on Elliptic Curves over the Ring Zn

    Three new trapdoor one-way functions are proposed that are based on elliptic curves over the ring Zn. The first class of functions is a naive construction, which can be used only in a digital signature scheme, an...
  18. Chapter

    Efficient Algorithms for the Construction of Hyperelliptic Cryptosystems

    The jacobian of hyperelliptic curves, including elliptic curves as a special case, offers a good primitive for cryptosystems, since cryptosystems (discrete logarithms) based on the jacobians seem to be more in...



  1. Chapter

    Universal Electronic Cash

    This paper proposes the first ideal untraceable electronic cash system which solves the most crucial problem inherent with real cash and all previous untraceable electronic cash systems. The main advantage of ...
  2. Chapter

    Membership Authentication for Hierarchical Multigroups Using the Extended Fiat-Shamir Scheme

    We propose two membership authentication schemes that allow an authorized user to construct one master secret key for accessing the set of hierarchically ordered groups defined by the user, without releasing a...
  3. Chapter

    ESIGN: An Efficient Digital Signature Implementation for Smart Cards

    ESIGN is an efficient digital signature algorithm [OkS], [Ok], whose computation speed is more than twenty times faster than that of the RSA scheme, while its key length and signature length are comparable to tho...
  4. Chapter

    Direct Zero Knowledge Proofs of Computational Power in Five Rounds

    Zero-knowledge proofs of computational power have been proposed by Yung and others. In this paper, we propose an efficient (direct) and constant round (five round) construction of zero knowledge proofs of computa...
  5. Chapter

    Interactive Bi-Proof Systems and Undeniable Signature Schemes

    This paper proposes a new construction of the minimum knowledge undeniable signature scheme which solves a problem inherent in Chaum’s scheme. We formulate a new proof system, the minimum knowledge interactive bi...
  6. Chapter

    How to Utilize the Randomness of Zero-Knowledge Proofs

    In zero-knowledge interactive proofs, a lot of randomized information is exchanged between the prover and the verifier, and the randomness of the prover is used in satisfying the zero-knowledge condition. In t...
  7. Chapter

    Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash

    In this paper, we propose a new type of authentication system, disposable zero-knowledge authentication system. Informally speaking, in this authentication system, double usage of the same authentication is preve...
  8. Chapter

    Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility

    In this paper, a new class of zero knowledge interactive proofs, a divertible zero knowledge interactive proof, is presented. Informally speaking, we call (A,B,C), a triplet of Turing machines, a divertible zero ...