Zero-knowledge proofs of identity
Journal of Cryptology
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Joint encryption and message-efficient secure computation
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Robust efficient distributed RSA-key generation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Signature schemes based on the strong RSA assumption
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Signature schemes based on the strong RSA assumption
ACM Transactions on Information and System Security (TISSEC)
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Robust and Efficient Sharing of RSA Functions
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Efficient Generation of Shared RSA Keys (Extended Abstract)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A Simplified Approach to Threshold and Proactive RSA
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Practical Threshold RSA Signatures without a Trusted Dealer
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Fully Distributed Threshold RSA under Standard Assumptions
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Secure hash-and-sign signatures without the random oracle
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Computing inverses over a shared secret modulus
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Practical threshold signatures
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Threshold Cryptosystems Based on Factoring
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Discrete Applied Mathematics - Special issue: Coding and cryptography
Efficient and secure self-escrowed public-key infrastructures
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Secure Arithmetic Computation with No Honest Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Discrete Applied Mathematics - Special issue: Coding and cryptography
A length-flexible threshold cryptosystem with applications
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Multiparty computation for interval, equality, and comparison without bit-decomposition protocol
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
A latency-free election scheme
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Making a nymbler nymble using VERBS
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
Improved primitives for secure multiparty integer computation
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Distributed paillier cryptosystem without trusted dealer
WISA'10 Proceedings of the 11th international conference on Information security applications
Shared RSA key generation in a mobile ad hoc network
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
Efficient secure two-party exponentiation
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Algebraic construction for zero-knowledge sets
Journal of Computer Science and Technology
Spreading alerts quietly and the subgroup escape problem
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
GBD threshold cryptography with an application to RSA key recovery
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
From passive to covert security at low cost
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Efficient, robust and constant-round distributed RSA key generation
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Optimizing robustness while generating shared secret safe primes
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Efficient threshold RSA signatures with general moduli and no extra assumptions
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Threshold cryptography in mobile ad hoc networks
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Secure computation of the mean and related statistics
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Secure computation with fixed-point numbers
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Modulo reduction for paillier encryptions and application to secure statistical analysis
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
A practical implementation of secure auctions based on multiparty integer computation
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Efficient binary conversion for paillier encrypted values
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Improved efficiency for private stable matching
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Threshold and proactive pseudo-random permutations
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Efficient cryptographic protocol design based on distributed el gamal encryption
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Efficient RSA key generation and threshold paillier in the two-party setting
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Accelerating the secure distributed computation of the mean by a chebyshev expansion
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Enhancing the efficiency in privacy preserving learning of decision trees in partitioned databases
PSD'12 Proceedings of the 2012 international conference on Privacy in Statistical Databases
Private over-threshold aggregation protocols
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
An efficient and probabilistic secure bit-decomposition
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
| Hi-index | 0.00 |
We present a new protocol for efficient distributed computation modulo a shared secret. We further present a protocol to distributively generate a random shared prime or safe prime that is much more efficient than previously known methods. This allows one to distributively compute shared RSA keys, where the modulus is the product of two safe primes, much more efficiently than was previously known.