How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Journal of Algorithms
A course in computational algebraic number theory
A course in computational algebraic number theory
A new public key cryptosystem based on higher residues
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
An Efficient Verifiable Encryption Scheme for Encryption of Discrete Logarithms
CARDIS '98 Proceedings of the The International Conference on Smart Card Research and Applications
On the Length of Cryptographic Hash-Values Used in Identification Schemes
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Sharing Decryption in the Context of Voting or Lotteries
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Short Proofs of Knowledge for Factoring
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Certificates of Recoverability with Scale Recovery Agent Security
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
RSA-Based Auto-recoverable Cryptosystems
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Verifiable secret-ballot elections
Verifiable secret-ballot elections
On diffie-hellman key agreement with short exponents
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Security proofs for signature schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Binding ElGamal: a fraud-detectable alternative to key-escrow proposals
EUROCRYPT'97 Proceedings of the 16th 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
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient proofs that a committed number lies in an interval
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Paillier's cryptosystem revisited
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Trapdooring Discrete Logarithms on Elliptic Curves over Rings
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A PVSS as Hard as Discrete Log and Shareholder Separability
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
One Round Threshold Discrete-Log Key Generation without Private Channels
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
A Public Key Cryptosystem Based On A Subgroup Membership Problem
Designs, Codes and Cryptography
On the Validity of the Φ-Hiding Assumption in Cryptographic Protocols
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Factorization of Square-Free Integers with High Bits Known
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
An efficient buyer-seller watermarking protocol based on composite signal representation
Proceedings of the 11th ACM workshop on Multimedia and security
Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII
Cryptocomputing with rationals
FC'02 Proceedings of the 6th international conference on Financial cryptography
An anonymous buyer-seller watermarking protocol with anonymity control
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Aggregate and verifiably encrypted signatures from bilinear maps
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
A provably secure anonymous buyer-seller watermarking protocol
IEEE Transactions on Information Forensics and Security
Factorization of square-free integers with high bits known
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
An ID-based optimistic fair signature exchange protocol from pairings
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
An ID-Based verifiable encrypted signature scheme based on hess’s scheme
CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology
Identity-Based aggregate and verifiably encrypted signatures from bilinear pairing
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
A secure and efficient proof of integer in an interval range
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
A privacy-preserving buyer-seller watermarking protocol with semi-trust third party
TrustBus'07 Proceedings of the 4th international conference on Trust, Privacy and Security in Digital Business
Anonymous broadcast encryption with an untrusted gateway
International Journal of Security and Networks
| Hi-index | 0.00 |
Cryptography is more and more concerned with elaborate protocols involving many participants. In some cases, it is crucial to be sure that players behave fairly especially when they use public key encryption. Accordingly, mechanisms are needed to check the correctness of encrypted data, without compromising secrecy. We consider an optimistic scenario in which users have pairs of public and private keys and give an encryption of their secret key with the public key of a third party. In this setting we wish to provide a publicly verifiable proof that the third party is able to recover the secret key if needed. Our emphasis is on size; we believe that the proof should be of the same length as the original key. In this paper, we propose such proofs of fair encryption for El Gamal and RSA keys, using the Paillier cryptosystem. Our proofs are really efficient since in practical terms they are only a few hundred bytes long. As an application, we design a very simple and efficient key recovery system.