会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明专利
    • Visual deciphery type secret sharing scheme
    • VISUAL DECIPHERY TYPE SECRET SHARING计划
    • JP2006020218A
    • 2006-01-19
    • JP2004198082
    • 2004-07-05
    • Kaoru KurosawaNec Soft LtdNecソフト株式会社馨 黒澤
    • YANASE NORIKOKITAZAWA ATSUSHIKUROSAWA KAORUKUAN BETO DAN
    • H04N1/387G06T1/00G09C5/00
    • PROBLEM TO BE SOLVED: To improve deterioration of contrast at the time of restoration of a secret image in a visual deciphery type secret sharing scheme in which the secret image is distributed to n (n is an integer ≥2) participants, no information is obtained about the secret image even when optional (k-1) participants of them are gathered, however, the secret image is restored when optional k (k is an integer ≥2≤n) participants are gathered.
      SOLUTION: A list Sij of distributed images (the j-th distributed image to a participant i, provided 1≤j≤t) is created by executing creation of the distributed images for t times equal to or more than twice, distributed to each participant, the participant obtains t intermediate restored images by restoring the secret image by overlapping a distributed image with the same order number among the distributed images from j=first to t-th of Sij, obtains one combined image by reversing each black and white of the t intermediate restored images and overlapping the t reversed images and restores the secret image by further reversing black and white of the combined image at the time of restoration.
      COPYRIGHT: (C)2006,JPO&NCIPI
    • 要解决的问题:为了在将秘密图像分配给n(n是整数≥2)的参与者的视觉解密类型秘密共享方案中恢复秘密图像时的对比度的改善,参与者,否 即使收集了可选(k-1)个参与者,也可获得关于秘密图像的信息,然而,当可选k(k是≥2≤n的整数)参与者被收集时,秘密图像被恢复。 解决方案:分布图像的列表Sij(第j个分布图像提供给参与者i,提供1≤j≤t)通过执行分布图像的创建t次等于或大于两次而创建,分布式 通过将分布图像中的相同次序数的重叠分布图像从第jj的第i个到第t个重新分配图像,从而获得t个中间恢复的图像,通过反转每个黑色和 t中间的白色恢复图像并重叠t反转的图像,并通过在恢复时进一步反转组合图像的黑白复原隐藏图像。 版权所有(C)2006,JPO&NCIPI
    • 2. 发明专利
    • Information providing device, information providing system, program for information providing device, and information providing method
    • 信息提供设备,信息提供系统,信息提供设备程序和信息提供方法
    • JP2006039674A
    • 2006-02-09
    • JP2004214726
    • 2004-07-22
    • Kaoru KurosawaNec Soft LtdNecソフト株式会社馨 黒澤
    • NAKAYAMA YUMIKOKUROSAWA KAORUKITAZAWA ATSUSHIKUAN BETO DAN
    • G06Q10/00G06Q30/06G06Q50/00H04L9/08
    • PROBLEM TO BE SOLVED: To provide an information providing device which provides a user with information, which the user selects, under the condition that the choice of the information by the user is concealed to an information provider. SOLUTION: Multiple kinds of encoded information, a plurality of keywords, a plurality of abstracts, a provider' secret key and public key are stored in an information providing device 1. A user terminal 2 refers to a plurality of abstracts opened to public on an Web site to select one keyword from the multiple kinds of information, selects an optional element, and generates purchase desire information Y from the selected keyword, the selected element and the public key. When receiving the purchase desire information Y transmitted from the user terminal 2 while keeping the selected keyword and the selected element secret, the information providing device 1 computes a transmission key K' from the purchase desire information Y and the secret key, transmits the transmission key to the user terminal 2, and makes the user terminal 2 decode only information corresponding to the keyword selected from the transmission key, the selected element and the multiple kinds of information. COPYRIGHT: (C)2006,JPO&NCIPI
    • 要解决的问题:提供一种在用户选择信息被隐藏到信息提供者的条件下向用户提供用户选择的信息的信息提供设备。 解决方案:信息提供装置1中存储有多种编码信息,多个关键字,多个摘要,提供者的秘密密钥和公开密钥。用户终端2参考多个摘要, 公众在网站上从多种信息中选择一个关键字,选择可选元素,并从所选择的关键字,所选择的元素和公钥中产生购买欲望信息Y. 信息提供装置1在接收从用户终端2发送的购买欲望信息Y的同时保持所选择的关键字和所选择的元素的秘密时,从购买期望信息Y和秘密密钥计算发送密钥K',发送发送密钥 并且使用户终端2仅解码与从传输密钥,所选择的元素和多种信息中选择的关键字相对应的信息。 版权所有(C)2006,JPO&NCIPI
    • 3. 发明专利
    • Loss communication method
    • 丢失通信方法
    • JP2005189273A
    • 2005-07-14
    • JP2003427058
    • 2003-12-24
    • Kaoru KurosawaNec Soft LtdNecソフト株式会社馨 黒澤
    • OGATA KAZUHIROKITAZAWA ATSUSHIKUROSAWA KAORUKUAN BETO DAN
    • G09C1/00
    • PROBLEM TO BE SOLVED: To decrease a communication frequency, a calculation amount and a communication amount of transfer processing between a sender and a receiver.
      SOLUTION: The loss communication method includes a first step for transmitting an original signal used for initialization processing to the receiver by communication from the sender to the receiver by the sender, a second step for transmitting a initialized signal obtained by using the original signal to the sender by the receiver, a third step for transmitting n (2 or more integer) kinds of information m
      1 -m
      n to the receiver so as not to be obtained except for the information selected by the receiver himself or herself for the receiver by using the initialized signal by the sender, and a fourth step for obtaining only the information selected by letting the sender not to know which information from among the n kinds of the information m
      1 -m
      n is selected by the receiver. The first to third steps are performed by an RSA cipher system.
      COPYRIGHT: (C)2005,JPO&NCIPI
    • 要解决的问题:减少发送方和接收方之间的通信频率,计算量和传送处理的通信量。 解决方案:丢失通信方法包括:第一步骤,用于通过发送方从发送方到接收方的通信向接收机发送用于初始化处理的原始信号;第二步骤,用于发送通过使用原始信息获得的初始化信号 由接收机发送给发送者的信号,向接收机发送n(2个以上整数)种信息m -m n 的第3步骤, 通过使用发送者的初始化信号,接收者自己为接收者选择的信息除外,以及第四步骤,仅获取通过让发送方不知道哪些信息中的哪些信息选择的信息 由接收机选择信息m 1 -m n 。 第一至第三步骤由RSA密码系统执行。 版权所有(C)2005,JPO&NCIPI
    • 4. 发明专利
    • Visual secret sharing scheme and visual secret sharing system
    • 视觉秘密共享方案和视觉秘密共享系统
    • JP2007150938A
    • 2007-06-14
    • JP2005344974
    • 2005-11-30
    • Kaoru KurosawaNational Institute Of Information & Communication TechnologyNec Soft LtdNecソフト株式会社独立行政法人情報通信研究機構馨 黒澤
    • HIGUCHI YUKIKITAZAWA ATSUSHIKUROSAWA KAORUOGATA WAKAHADUONG QUANG VIET
    • H04L9/10G06F21/24G09C1/00
    • G09C5/00
    • PROBLEM TO BE SOLVED: To provide visual secret sharing scheme and system which reduce the number of sheets of distributed OHP sheets which each participant has to have. SOLUTION: As a method of distributing a secret picture, threshold (k, n) method of Shamir on an extension field GF (2"m) is used. In order to distribute the secret picture using the threshold (k, n) method of Shamir on the extension field FG (2"m), in each pixel, a degree which becomes a polynomial f(0 ... 0)=(1 ... 1) at the time of a black pixel (p=1), and a polynomial f(0 ... 0)=(0 ... 0) at the time of a white pixel (p=0), generates a k-primary random polynomial f(x). In order to distribute using the threshold (k, n) method of the Shamir on an extension field GF(2"m) to the secret picture of m sheets, in the chromatic of each pixel p_1,...,p_m, it sets, a degree which becomes a polynomial f(0 ... 0)=(p_1 ... p_m) generates a k-primary random polynomial f(x). COPYRIGHT: (C)2007,JPO&INPIT
    • 要解决的问题:提供视觉秘密共享方案和系统,减少每个参与者必须具有的分布式OHP表的张数。 解决方案:作为分发秘密图像的方法,使用扩展字段GF(2“m)上的Shamir的阈值(k,n)方法,为了使用阈值(k,n )在每个像素中的扩展字段FG(2“m)上的Shamir方法成为黑色像素时的多项式f(0 ... 0)=(1 ... 1)的度(p = 1),并且在白色像素(p = 0)时的多项式f(0 ... 0)=(0 ... 0)生成k次随机多项式f(x)。 为了使用扩展字段GF(2“m)上的Shamir的阈值(k,n)方法分配给m页的秘密图像,在每个像素p_1,...,p_m的色度中,它设置 ,成为多项式f(0 ... 0)=(p_1 ... p_m)的度产生k次随机多项式f(x)。版权所有(C)2007,JPO&INPIT
    • 5. 发明专利
    • On-demand retrieval method, on-demand retrieval system, and use terminal
    • 需求检索方法,需求检索系统和使用终端
    • JP2007013564A
    • 2007-01-18
    • JP2005191661
    • 2005-06-30
    • Kaoru KurosawaNec Soft LtdNecソフト株式会社馨 黒澤
    • HIGUCHI YUKIKITAZAWA ATSUSHIKUROSAWA KAORUOGATA WAKAHA
    • H04L9/32G06F21/24G09C1/00
    • PROBLEM TO BE SOLVED: To reduce the amount of communication of data to be exchanged in oblivious keyword search between an information provider and a user, and to verify whether information providing is performed properly by following the procedure. SOLUTION: By applying a system based on discrete logarithm problem on an elliptic curve whose key length size can be set to 160 bit or so, the amount of communication is reduced to one-third in comparison with the conventional RSA signature system. Also, by applying Weil pairing or Tate pairing defined on the elliptic curve for illegality prevention for the information provider, it can be verified whether the information providing is performed properly by following the procedure. COPYRIGHT: (C)2007,JPO&INPIT
    • 要解决的问题:为了减少在信息提供者和用户之间的遗忘关键字搜索中要交换的数据的通信量,并且通过遵循该过程来验证信息提供是否被正确地执行。 解决方案:通过在密钥长度可以设置为160位左右的椭圆曲线上应用基于离散对数问题的系统,与传统的RSA签名系统相比,通信量减少到三分之一。 另外,通过对信息提供者进行非法预防的椭圆曲线上定义的Weil配对或Tate配对,可以通过遵循该过程来验证信息提供是否正确执行。 版权所有(C)2007,JPO&INPIT
    • 6. 发明专利
    • Electronic voting system and electronic voting method
    • 电子投票系统和电子投票方法
    • JP2007011768A
    • 2007-01-18
    • JP2005192859
    • 2005-06-30
    • Kaoru KurosawaNec Soft LtdNecソフト株式会社馨 黒澤
    • HIGUCHI YUKIKITAZAWA ATSUSHIKUROSAWA KAORU
    • G06Q50/00G06Q50/10G06Q50/34G07C13/00H04L9/32
    • PROBLEM TO BE SOLVED: To provide an electronic voting system reducing time and labor for preparing votes given by voters and eliminating invalid votes. SOLUTION: Out of votes corresponding to a plurality of candidates prepared by an election official terminal 20 using oblivious transfer, only the votes corresponding to one candidate selected by a voter terminal 10 are tabulated by a vote counter terminal 40. The voter terminal can save time for preparing votes and asking for signatures, and a possibility of preparing the invalid votes can be eliminated. Further, when the vote counter 40 counts the votes of the voters, only the calculation of optional hash functions and checking of continuous zeros are required to reduce processing of the vote counter terminal 40. COPYRIGHT: (C)2007,JPO&INPIT
    • 要解决的问题:提供一个电子投票制度,减少选民投票和取消无效票的时间和劳动。

      解决方案:选举官员终端20使用遗漏转移准备的多个候选人的票数相对应,投票终端40仅列出与选民终端10选择的一个候选人对应的投票。选举人终端 可以节省准备投票和要求签名的时间,可以消除准备无效投票的可能性。 此外,当投票计数器40计数投票时,只需要选择散列函数的计算和连续零的检查来减少投票计数器终端40的处理。(C)2007年,JPO和INPIT

    • 8. 发明授权
    • Data processing apparatus
    • 数据处理装置
    • US4833471A
    • 1989-05-23
    • US931015
    • 1986-11-17
    • Yoshihiro TokuumeShigeo TsujiiKaoru Kurosawa
    • Yoshihiro TokuumeShigeo TsujiiKaoru Kurosawa
    • H03M5/14
    • H03M5/145
    • There is provided a data processing apparatus for encoding or decoding binary data such as a magnetic disk or an optical disk in which a binary data sequence is converted to a binary code sequence which is suitable for a data processes. This data processing apparatus comprises: a code converter for converting the m-bit data in the binary data sequence to the n-bit code corresponding thereto; output means for outputting the n-bit code sequence corresponding to the binary data sequence; and DC-freeing means for restricting the DC component of the code sequence which is outputted from the output means. The code converter has a ROM table to store the data for code conversion and a register for converting the m-bit serial data to the parallel data and can be easily constituted by a programmable array logic.
    • 提供了一种用于对诸如磁盘或光盘的二进制数据进行编码或解码的数据处理装置,其中二进制数据序列被转换为适合于数据处理的二进制代码序列。 该数据处理装置包括:代码转换器,用于将二进制数据序列中的m位数据转换为与之对应的n位代码; 输出装置,用于输出对应于二进制数据序列的n位代码序列; 以及用于限制从输出装置输出的代码序列的DC分量的DC释放装置。 代码转换器具有用于存储用于代码转换的数据的ROM表和用于将m位串行数据转换为并行数据的寄存器,并且可以容易地由可编程阵列逻辑构成。