A framework for the study of cryptographic protocols
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Demonstrating possession of a discrete logarithm without revealing it
Proceedings on Advances in cryptology---CRYPTO '86
A private interactive test of a boolean predicate a minimum-knowledge public-key cryptosystems
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Zero-knowledge proofs of identity and veracity of transaction receipts
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Oblivious transfer protecting secrecy
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Practical and provably secure release of a secret and exchange of signatures
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Journal of the ACM (JACM)
An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Verifiable Partial Escrow of Integer Factors
Designs, Codes and Cryptography
Attacks Based on Small Factors in Various Group Structures
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
RSA-Based Undeniable Signatures for General Moduli
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Verifiable Partial Sharing of Integer Fractions
SAC '98 Proceedings of the Selected Areas in Cryptography
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Separability and Efficiency for Generic Group Signature Schemes
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
New Constructions of Fail-Stop Signatures and Lower Bounds (Extended Abstract)
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
A New Efficient All-Or-Nothing Disclosure of Secrets Protocol
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
A Group Signature Scheme with Improved Efficiency
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Emerging Standards for Public-Key Cryptography
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
A New Offline Privacy Protecting E-cash System with Revokable Anonymity
ISC '02 Proceedings of the 5th International Conference on Information Security
RSA Key Generation with Verifiable Randomness
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Security of Signature Schemes in a Multi-User Setting
Designs, Codes and Cryptography
Single-bit re-encryption with applications to distributed proof systems
Proceedings of the 2007 ACM workshop on Privacy in electronic society
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Blinding for unanticipated signatures
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Proving in zero-knowledge that a number is the product of two safe primes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Non-interactive zero-knowledge from homomorphic encryption
TCC'06 Proceedings of the Third conference on Theory of Cryptography
| Hi-index | 0.00 |
We present a protocol for convincing an opponent that an integer N is of the form PrQs, with P and Q primes congruent to 3 modulo 4 and with r and s odd. Our protocol is provably secure in the sense that it does not reveal the factors of N. The protocol is very fast and therefore can be used in practice.