A randomized protocol for signing contracts
Communications of the ACM
Distributing the power of a government to enhance the privacy of voters
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
An efficient probabilistic public key encryption scheme which hides all partial information
Proceedings of CRYPTO 84 on Advances in cryptology
The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The cryptographic security of truncated linearly related variables
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
One-way functions and pseudorandom generators
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Zero knowledge proofs of identity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Achieving independence in logarithmic number of rounds
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Relations Among Complexity Measures
Journal of the ACM (JACM)
ACM Transactions on Computer Systems (TOCS)
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Primality and Cryptography
A Fair Protocol for Signing Contracts (Extended Abstract)
Proceedings of the 12th Colloquium on Automata, Languages and Programming
How to Solve any Protocol Problem - An Efficiency Improvement
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
Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
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
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A logic to reason about likelihood
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
How to generate cryptographically strong sequences of pseudo random bits
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Protocols for secure computations
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
How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Trapdoor pseudo-random number generators, with applications to protocol design
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
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
A robust and verifiable cryptographically secure election scheme
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Verifiable secret sharing and achieving simultaneity in the presence of faults
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
RSA/Rabin Bits are 1/2 + 1 Poly (Log N) Secure
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Efficient And Secure Pseudo-Random Number Generation
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
How To Construct Randolli Functions
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Secure and verifiable schemes for election and general distributed computing problems
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
On generating solved instances of computational problems
CRYPTO '88 Proceedings on Advances in cryptology
A universal problem in secure and verifiable distributed computation
CRYPTO '88 Proceedings on Advances in cryptology
The round complexity of secure protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Public-randomness in public-key cryptography (extended abstract)
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
How to withstand mobile virus attacks (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Journal of the ACM (JACM)
Non-interactive oblivious transfer and applications
CRYPTO '89 Proceedings on Advances in cryptology
Multiparty computation with faulty majority
CRYPTO '89 Proceedings on Advances in cryptology
Correlated pseudorandomness and the complexity of private computations
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Robust efficient distributed RSA-key generation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Universally composable two-party and multi-party secure computation
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Secure Computation without Agreement
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Universally Composable Commitments
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Gradual and Verifiable Release of a Secret
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Collective Coin Tossing Without Assumptions nor Broadcasting
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Security with Low Communication Overhead
CRYPTO '90 Proceedings of the 10th 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
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Efficient Multiparty Protocols Using Circuit Randomization
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Foundations of Secure Interactive Computing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Joint Encryption and Message-Efficient Secure Computation
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Efficient Secure Multi-party Computation
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Introduction to Secure Computation
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
Non-interactive Private Auctions
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
FC '99 Proceedings of the Third International Conference on Financial Cryptography
Non-Interactive CryptoComputing For NC1
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Complete fairness in secure two-party computation
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Weaknesses of undeniable signature schemes
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Cryptographic protocols provably secure against dynamic adversaries
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
General secure multi-party computation from any linear secret-sharing scheme
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Fair secure two-party computation
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Simple and efficient perfectly-secure asynchronous MPC
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Perfectly-secure MPC with linear communication complexity
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Secure efficient multiparty computing of multivariate polynomials and applications
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
1/p-Secure multiparty computation without honest majority and the best of both worlds
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Complete Fairness in Secure Two-Party Computation
Journal of the ACM (JACM)
Dynamic threshold and cheater resistance for shamir secret sharing scheme
Inscrypt'06 Proceedings of the Second SKLOIS conference on Information Security and Cryptology
A round and communication efficient secure ranking protocol
CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
On complete primitives for fairness
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Founding cryptography on tamper-proof hardware tokens
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
The marriage proposals problem: fair and efficient solution for two-party computations
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Partial fairness in secure two-party computation
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Efficient secure computation with garbled circuits
ICISS'11 Proceedings of the 7th international conference on Information Systems Security
Efficient multi-party computation with dispute control
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Resource fairness and composability of cryptographic protocols
TCC'06 Proceedings of the Third conference on Theory of Cryptography
| Hi-index | 0.00 |
An important area of research in cryptography is the design of protocols for carrying on certain transactions in a communications network, such as playing poker or holding an election. Many of the protocols proposed in this area have required the expensive on-line generation of a large number of new keys. On the other hand, fundamental research in the traditional problems of cryptography, such as encryption and authentication, has developed the public-key model, in which each user has a single validated public key. This model is appropriate to those situations in which generation and validation of new keys is very costly or is otherwise limited. Procedures proposed for this model must preserve the security of the keys. An important question is whether flexible protocol design for a wide variety of problems is possible within the public-key model, so that the expense of generating new keys can be minimized