A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Probabilistic encryption & how to play mental poker keeping secret all partial information
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On the cryptographic security of single RSA bits
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
How to generate cryptographically strong sequences of pseudo random bits
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Why and how to establish a private code on a public network
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
New directions in cryptography
IEEE Transactions on Information Theory
Proceedings of CRYPTO 84 on Advances in cryptology
Towards a theory of software protection and simulation by oblivious RAMs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Towards a theory of software protection
Proceedings on Advances in cryptology---CRYPTO '86
A new probabilistic encryption scheme
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Abuses in cryptography and how to fight them
CRYPTO '88 Proceedings on Advances in cryptology
The discrete log is very discreet
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Public-key cryptosystems provably secure against chosen ciphertext attacks
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
CRYPTO '89 Proceedings on Advances in cryptology
Cryptographic defense against traffic analysis
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
A Model for Secure Protocols and Their Compositions
IEEE Transactions on Software Engineering
Fundamentals of computing (a cheatlist)
ACM SIGACT News
Proceedings of the 4th ACM conference on Computer and communications security
On the limits of non-approximability of lattice problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Pseudo-random functions and factoring (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On the Use of RSA as a Secret Key Cryptosystem
Designs, Codes and Cryptography
On the Security of an RSA Based Encryption Scheme
ACISP '99 Proceedings of the 4th Australasian Conference on Information Security and Privacy
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Design and Analysis of Fast Provably Secure Public-Key Cryptosystems Based on a Modular Squaring
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Session-Key Generation Using Human Passwords Only
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
On Using RSA with Low Exponent in a Public Key Network
CRYPTO '85 Advances in Cryptology
Symmetric Public-Key Encryption
CRYPTO '85 Advances in Cryptology
A Secure Poker Protocol that Minimizes the Effect of Player Coalitions
CRYPTO '85 Advances in Cryptology
A Framework for the Study of Cryptographic Protocols
CRYPTO '85 Advances in Cryptology
Special Uses and Sbuses of the Fiat-Shamir Passport Protocol
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Direct Minimum-Knowledge Computations
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Secure Integration of Asymmetric and Symmetric Encryption Schemes
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
The Bit Security of Paillier's Encryption Scheme and Its Applications
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Improving the Security of the McEliece Public-Key Cryptosystem
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Key-Privacy in Public-Key Encryption
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Anonymous Authentication of Membership in Dynamic Groups
FC '99 Proceedings of the Third International Conference on Financial Cryptography
How to Enhance the Security of Public-Key Encryption at Minimum Cost
PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
How to Fool an Unbounded Adversary with a Short Key
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Lower bounds on the efficiency of encryption and digital signature schemes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Cryptography and cryptographic protocols
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Number-theoretic constructions of efficient pseudo-random functions
Journal of the ACM (JACM)
Foundations of cryptography: a primer
Foundations and Trends® in Theoretical Computer Science
A survey of homomorphic encryption for nonspecialists
EURASIP Journal on Information Security
Privacy-preserving link discovery
Proceedings of the 2008 ACM symposium on Applied computing
Privacy-preserving Naïve Bayes classification
The VLDB Journal — The International Journal on Very Large Data Bases
Secure Construction of Contingency Tables from Distributed Data
Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security
Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Privacy-preserving linear programming
Proceedings of the 2009 ACM symposium on Applied Computing
Practical Chosen Ciphertext Secure Encryption from Factoring
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Privacy-preserving indexing of documents on the network
The VLDB Journal — The International Journal on Very Large Data Bases
Towards a separation of semantic and CCA security for public key encryption
TCC'07 Proceedings of the 4th conference on Theory of cryptography
A two-server, sealed-bid auction protocol
FC'02 Proceedings of the 6th international conference on Financial cryptography
Efficient and non-malleable proofs of plaintext knowledge and applications
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Efficient chosen-ciphertext secure identity-based encryption with wildcards
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Chosen ciphertext secure encryption under factoring assumption revisited
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Threshold and revocation cryptosystems via extractable hash proofs
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Cryptography in constant parallel time
Cryptography in constant parallel time
Protecting data privacy through hard-to-reverse negative databases
ISC'06 Proceedings of the 9th international conference on Information Security
Trading one-wayness against chosen-ciphertext security in factoring-based encryption
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Questionable encryption and its applications
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
Public-key cryptography and availability
SAFECOMP'05 Proceedings of the 24th international conference on Computer Safety, Reliability, and Security
Improved efficiency of chosen ciphertext secure encryption from factoring
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
A special purpose integer factorization algorithm
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Simple, efficient and strongly KI-Secure hierarchical key assignment schemes
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
| Hi-index | 0.00 |
This paper introduces the first probabilistic public-key encryption scheme which combines the following two properties: (1) Perfect secrecy with respect to polynomial time eavesdroppers: For all message spaces, no polynomial time bounded passive adversary who is tapping the lines, can compute any partial information about messages from their encodings, unless factoring composite integers is in probabilisic polynomial time. (2) Efficiecy: It compares favorably with the deterministic RSA public-key cryptosystem in both encoding and decoding time and bandwidth expansion.The security of the system we propose can also be based on the assumption that the RSA function is intractable, maintaining the same cost for encoding and decoding and the Same data expansion. This implementation may have advantages in practice.