Publications associées à Efficient Protocols for Set Membership and Range Proofs

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in $\mathbb{F}_{2^{1971}}$ and $\mathbb{F}_{2^{3164}}$

Robert Granger, Jens Markus Zumbrägel

In this paper we propose a binary field variant of the Joux-Lercier medium-sized Function Field Sieve, which results not only in complexities as low as

L_{q^n}(1/3,(4/9)1/3)

for computing arbitrary logarithms, but also in an heuristic polynomial time alg ...

Springer Berlin Heidelberg2013

Efficient Protocols for Set Membership and Range Proofs

Graph Chatbot

Chattez avec Graph Search

Measurement and characterization of room impulse responses

Optimally Efficient Multi-Party Fair Exchange and Fair Secure Multi-Party Computation

Stability of the Classifications of Returns to Scale in Data Envelopment Analysis: A Case Study of the Set of Public Postal Operators

I4U Submission to NIST SRE 2012: a large-scale collaborative effort for noise-robust speaker verification

I4U Submission to NIST SRE 2012: a large-scale collaborative effort for noise-robust speaker verification

On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in $\mathbb{F}_{2^{1971}}$ and $\mathbb{F}_{2^{3164}}$

UC and EUC Weak Bit-Commitments Using Seal-Once Tamper-Evidence

A Non-interactive Range Proof with Constant Communication

Cryptographic Hash Functions in Groups and Provable Properties

Set membership proofs in data processing systems

Measurement and characterization of room impulse responses

Stability of the Classifications of Returns to Scale in Data Envelopment Analysis: A Case Study of the Set of Public Postal Operators

I4U Submission to NIST SRE 2012: a large-scale collaborative effort for noise-robust speaker verification

I4U Submission to NIST SRE 2012: a large-scale collaborative effort for noise-robust speaker verification

UC and EUC Weak Bit-Commitments Using Seal-Once Tamper-Evidence

Optimally Efficient Multi-Party Fair Exchange and Fair Secure Multi-Party Computation

On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in $\mathbb{F}_{2^{1971}}$ and $\mathbb{F}_{2^{3164}}$

A Non-interactive Range Proof with Constant Communication

Cryptographic Hash Functions in Groups and Provable Properties

Set membership proofs in data processing systems