Verifiable partial sharing of integer factors
Wenbo Mao
- pp 94-105
Reads0
Chats0
TLDR
This work constructs a scheme on exploitation of a significantly lowered complexity for factoring n = pq using a non-trivial factor of Φ(n) and proves its verifiability with confidence.Abstract:
It is not known to date how to partially share the factors of an integer (e.g., an RSA modulus) with verifiability. We construct such a scheme on exploitation of a significantly lowered complexity for factoring n = pq using a non-trivial factor of φ(n).read more
Citations
More filters
Posted Content
Coercion-Resistant Electronic Elections.
TL;DR: In this paper, the authors introduce a model for electronic election schemes that involves a more powerful adversary than previous work, allowing the adversary to demand of coerced voters that they vote in a particular manner, abstain from voting, or even disclose their secret keys.
Book ChapterDOI
Proving in zero-knowledge that a number is the product of two safe primes
Jan Camenisch,Markus Michels +1 more
TL;DR: This work presents the first efficient statistical zero-knowledge protocols to prove statements such as - A committed number is a prime and any multivariate modular polynomial equation is satisfied, where only commitments to the variables of thepolynomial and to the modulus need to be known.
Proceedings ArticleDOI
Coercion-resistant electronic elections
TL;DR: A model for electronic election schemes that involves a more powerful adversary than previous work that allows the adversary to demand of coerced voters that they vote in a particular manner, abstain from voting, or even disclose their secret keys.
Book ChapterDOI
RSA Key Generation with Verifiable Randomness
Ari Juels,Jorge Guajardo +1 more
TL;DR: This work considers the problem of proving that a user has selected and correctly employed a truly random seed in the generation of her RSA key pair, and proposes a KEGVER protocol for RSA key generation, which is to show in zero knowledge that a private key has been generated at random according to a prescribed process.
Patent
Metering in a data processing system
Wenbo Mao,Liqun Chen +1 more
TL;DR: In this paper, a data processing system is described wherein use of resources in the system is metered and the tamper-resistance of the metering evidence is attributed to the difficulty of factorising a large integer which has only two prime factors of roughly equal size.
References
More filters
Journal ArticleDOI
How to share a secret
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Book
A Course in Computational Algebraic Number Theory
TL;DR: The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods.
Book ChapterDOI
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
TL;DR: It is shown how to distribute a secret to n persons such that each person can verify that he has received correct information about the secret without talking with other persons.
Book ChapterDOI
Wallet Databases with Observers
David Chaum,Torben P. Pedersen +1 more
TL;DR: This article argues that a particular combination of these two kinds of mechanism can overcome the limitations of each alone, providing both security and correctness for organizations as well as privacy and even anonymity for individuals.
Journal ArticleDOI
Coin flipping by telephone a protocol for solving impossible problems
TL;DR: In this article, the authors define coin-flipping as a special way to solve problems such as mental poker, certified mail, and exchange of secrets, and demonstrate its usefulness in solving a number of problems once thought impossible.