STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first 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
How to withstand mobile virus attacks (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Adaptively secure multi-party computation
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Communications of the ACM
Secure Distributed Storage and Retrieval
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Hiding Instances in Multioracle Queries
STACS '90 Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Fair Computation of General Functions in Presence of Immoral Majority
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Maintaining Security in the Presence of Transient Faults
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Relations Among Notions of Security for Public-Key Encryption Schemes
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Algorithmic Issues in Coding Theory
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
An Efficient Off-line Electronic Cash System Based On The Representation Problem.
An Efficient Off-line Electronic Cash System Based On The Representation Problem.
A practical scheme for non-interactive verifiable secret sharing
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Composition and integrity preservation of secure reactive systems
Proceedings of the 7th ACM conference on Computer and communications security
Efficient oblivious transfer protocols
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Adaptively secure distributed public-key systems
Theoretical Computer Science
Securing "Encryption + Proof of Knowledge" in the Random Oracle Model
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Unconditionally Secure Key Insulated Cryptosystems: Models, Bounds and Constructions
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
Electronic Jury Voting Protocols
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: 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
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
Proofs of Knowledge for Non-monotone Discrete-Log Formulae and Applications
ISC '02 Proceedings of the 5th International Conference on Information Security
Efficient Revocation in Group Signatures
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
An Efficient Two-Party Public Key Cryptosystem Secure against Adaptive Chosen Ciphertext Attack
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Robust Distributed Multiplicaton with out Interaction
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Electronic jury voting protocols
Theoretical Computer Science - Latin American theorotical informatics
Distributing the Encryption and Decryption of a Block Cipher
Designs, Codes and Cryptography
Direct chosen ciphertext security from identity-based techniques
Proceedings of the 12th ACM conference on Computer and communications security
The reactive simulatability (RSIM) framework for asynchronous systems
Information and Computation
Ad-Hoc Threshold Broadcast Encryption with Shorter Ciphertexts
Electronic Notes in Theoretical Computer Science (ENTCS)
Simplified Submission of Inputs to Protocols
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Chosen-Ciphertext Secure Proxy Re-encryption without Pairings
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Construction of Threshold Public-Key Encryptions through Tag-Based Encryptions
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Efficient hybrid encryption from ID-based encryption
Designs, Codes and Cryptography
Distributed Pseudo-random functions and KDCs
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Adaptively secure threshold cryptography: introducing concurrency, removing erasures
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A CCA2 secure key encapsulation scheme based on 3rd order shift registers
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Seeing through mist given a small fraction of an RSA private key
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
CCA2-secure threshold broadcast encryption with shorter ciphertexts
ProvSec'07 Proceedings of the 1st international conference on Provable security
Miniature CCA2 PK encryption: tight security without redundancy
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Chosen-ciphertext secure bidirectional proxy re-encryption schemes without pairings
Information Sciences: an International Journal
Threshold public-key encryption with adaptive security and short ciphertexts
ICICS'10 Proceedings of the 12th international conference on Information and communications security
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
Adaptively secure non-interactive threshold cryptosystems
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Chosen ciphertext secure public key threshold encryption without random oracles
CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
How to construct multicast cryptosystems provably secure against adaptive chosen ciphertext attack
CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
Chosen-ciphertext security of multiple encryption
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Share conversion, pseudorandom secret-sharing and applications to secure computation
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Practical pay-TV scheme using traitor tracing scheme for multiple channels
WISA'04 Proceedings of the 5th international conference on Information Security Applications
Tag-KEM/DEM: a new framework for hybrid encryption and a new analysis of kurosawa-desmedt KEM
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Constant size ciphertexts in threshold attribute-based encryption
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Information-theoretically secure key-insulated multireceiver authentication codes
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Ensuring privacy in smartcard-based payment systems: a case study of public metro transit systems
CMS'06 Proceedings of the 10th IFIP TC-6 TC-11 international conference on Communications and Multimedia Security
On error correction in the exponent
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Universal custodian-hiding verifiable encryption for discrete logarithms
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Efficient threshold encryption from lossy trapdoor functions
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
Generic construction of chosen ciphertext secure proxy re-encryption
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Provably secure threshold public-key encryption with adaptive security and short ciphertexts
Information Sciences: an International Journal
Multi-Committer threshold commitment scheme from lattice
PAISI'12 Proceedings of the 2012 Pacific Asia conference on Intelligence and Security Informatics
A generalization and a variant of two threshold cryptosystems based on factoring
ISC'07 Proceedings of the 10th international conference on Information Security
Adaptively secure forward-secure non-interactive threshold cryptosystems
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Adaptively secure non-interactive threshold cryptosystems
Theoretical Computer Science
How to share a lattice trapdoor: threshold protocols for signatures and (H)IBE
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Threshold public key encryption scheme resilient against continual leakage without random oracles
Frontiers of Computer Science: Selected Publications from Chinese Universities
Hi-index | 0.00 |
This paper proposes a simple threshold Public-Key Cryptosystem (PKC) which is secure against adaptive chosen ciphertext attack, under the Decisional Diffie-Hellman (DDH) intractability assumption. Previously, it was shown how to design non-interactive threshold PKC secure under chosen ciphertext attack, in the random-oracle model and under the DDH intractability assumption [25]. The random-oracle was used both in the proof of security and to eliminate interaction. General completeness results for multi-party computations [6,13] enable in principle converting any single server PKC secure against CCA (e.g., [19,17]) into a threshold one, but the conversions are inefficient and require much interaction among the servers for each ciphertext decrypted. The recent work by Cramer and Shoup [17] on single server PKC secure against adaptive CCA is the starting point for the new proposal.