• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

A study on MIX-nets and its applications

Research Project

Project/Area Number 14580358
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field 計算機科学
Research InstitutionIbaraki University

Principal Investigator

KUROSAWA Kaoru  Ibaraki University, College of Engineering, Professor, 工学部, 教授 (60153409)

Project Period (FY) 2002 – 2003
Project Status Completed (Fiscal Year 2003)
Budget Amount *help
¥3,400,000 (Direct Cost: ¥3,400,000)
Fiscal Year 2003: ¥1,300,000 (Direct Cost: ¥1,300,000)
Fiscal Year 2002: ¥2,100,000 (Direct Cost: ¥2,100,000)
KeywordsShuffle / privacy / MIX-net / ElGamal encryption / Paillier encryption / Decisional DH assumption / Decisional Nth residue assumption / 匿名性 / 安全性
Research Abstract

This research preject proposes a formal model for security of verifiable shuffles and prove the security of some recently proposed shuffle schemes in this model. The model is general and can be extended to mix-nets and verifiable shuffle decryption. The research preject also proposes a new, verifiable shuffle system based on Paillier encryption scheme and prove its security in the proposed model. The new shuffle has the least number of rounds and exponentiations if a variant of Paillier scheme is used

Report

(3 results)
  • 2003 Annual Research Report   Final Research Report Summary
  • 2002 Annual Research Report
  • Research Products

    (3 results)

All Other

All Publications (3 results)

  • [Publications] Lan Nguyen, Rei Safavi-Naini, Kaoru Kurosawa: "Verifiable Shuffle : A formal model and a Paillier-based efficient construction with provable security"Proc.of Applied Cryptography and Network Security (ACNS'04). LNCS 未定. (2004)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      2003 Final Research Report Summary
  • [Publications] Lan Nguyen, Rei Safavi-Naini, Kaoru Kurosawa: "Verifiable shuffles A formal model and a Paillier-based efficient construction with provable Security"Proc. of Applied Cryptography and Network Network Security, LNCS series. (2004)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2003 Final Research Report Summary
  • [Publications] L.Nguen, R.S.Naini, K.Kurosawa: "Verifiable Shuffle : A formal model and a Paillier-based efficient const ruction with provable security"Proc.of Applied Cryptography and Network Security. LNCS(未定). (2004)

    • Related Report
      2003 Annual Research Report

URL: 

Published: 2002-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi