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
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Minimum-knowledge interactive proofs for decision problems
SIAM Journal on Computing
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Journal of Cryptology
The round complexity of secure protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Uses of randomness in algorithms and protocols
Uses of randomness in algorithms and protocols
SIAM Journal on Computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Complexity and security of distributed protocols
Complexity and security of distributed protocols
A minimal model for secure computation (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the Composition of Zero-Knowledge Proof Systems
SIAM Journal on Computing
Witness-based cryptographic program checking and robust function sharing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A new public key cryptosystem based on higher residues
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
SIAM Journal on Computing
Hiding Instances in Multioracle Queries
STACS '90 Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science
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
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
Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract)
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
On the Security of ElGamal Based Encryption
PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Number-theoretic constructions of efficient pseudo-random functions
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Universal circuits (Preliminary Report)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Zero-knowledge proofs of knowledge without interaction
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
The round complexity of verifiable secret sharing and secure multicast
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
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
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
One-Round Secure Computation and Secure Autonomous Mobile Agents
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Cryptographic Solution to a Game Theoretic Problem
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
On the (Im)possibility of Obfuscating Programs
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
On 2-Round Secure Multiparty Computation
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances 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
Oblivious Polynomial Evaluation and Oblivious Neural Learning
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
DISSECT: DIStribution for SECurity Tool
ISC '01 Proceedings of the 4th International Conference on Information Security
Secure Server-Aided Signature Generation
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Protecting Mobile Code in the Wild
IEEE Internet Computing
Verifiable distributed oblivious transfer and mobile agent security
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
RDS: Remote Distributed Scheme for Protecting Mobile Agents
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Approaches to fault-tolerant and transactional mobile agent execution---an algorithmic view
ACM Computing Surveys (CSUR)
Policy-hiding access control in open environment
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Verifiable distributed oblivious transfer and mobile agent security
Mobile Networks and Applications
Oblivious polynomial evaluation and oblivious neural learning
Theoretical Computer Science
Secure mobile agent system and its application in the trust building process of virtual enterprises
Multiagent and Grid Systems
Extending tamper-proof hardware security to untrusted execution environments
CARDIS'02 Proceedings of the 5th conference on Smart Card Research and Advanced Application Conference - Volume 5
Privacy-preserving remote diagnostics
Proceedings of the 14th ACM conference on Computer and communications security
Distributed privacy preserving k-means clustering with additive secret sharing
PAIS '08 Proceedings of the 2008 international workshop on Privacy and anonymity in information society
A New Protocol for Conditional Disclosure of Secrets and Its Applications
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Improved Garbled Circuit: Free XOR Gates and Applications
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Homomorphic Encryption with CCA Security
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
Financial Cryptography and Data Security
Communication Complexity in Algebraic Two-Party Protocols
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Towards Robust Computation on Encrypted Data
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
ICISS '08 Proceedings of the 4th International Conference on Information Systems Security
Information Security and Cryptology --- ICISC 2008
Fully homomorphic encryption using ideal lattices
Proceedings of the forty-first annual ACM symposium on Theory of computing
Practical Private DNA String Searching and Matching through Efficient Oblivious Automata Evaluation
Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII
Secure Multi-party Computation Minimizing Online Rounds
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Oblivious Multi-variate Polynomial Evaluation
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Securely outsourcing linear algebra computations
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Minimal-latency secure function evaluation
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Secure linear algebra using linearly recurrent sequences
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Evaluating branching programs on encrypted data
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Efficient multi-party computation over rings
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Public key encryption that allows PIR queries
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Universally-composable two-party computation in two rounds
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Two-party computing with encrypted data
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Black-box extension fields and the inexistence of field-homomorphic one-way permutations
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Secure multiparty computation of DNF
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Secure evaluation of private linear branching programs with medical applications
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Securing computation against continuous leakage
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Additively homomorphic encryption with d-operand multiplications
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
i-hop homomorphic encryption and rerandomizable Yao circuits
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Secure multiparty computation with minimal interaction
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Round-efficient sub-linear zero-knowledge arguments for linear algebra
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Efficient non-interactive secure computation
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Benaloh's dense probabilistic encryption revisited
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Public-key encrypted bloom filters with applications to supply chain integrity
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
Gate evaluation secret sharing and secure one-round two-party computation
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Evaluating 2-DNF formulas on ciphertexts
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Private searching on streaming data
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
An efficient and verifiable solution to the millionaire problem
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
On the (im)possibility of obfuscating programs
Journal of the ACM (JACM)
Ciphertext comparison, a new solution to the millionaire problem
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
A simple BGN-Type cryptosystem from LWE
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Communication efficient secure linear algebra
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Constant-Round private function evaluation with linear complexity
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Constant-round private database queries
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
International Journal of Data Warehousing and Mining
MrCrypt: static analysis for secure cloud computations
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
Privacy-preserving billing for e-ticketing systems in public transportation
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
| Hi-index | 0.00 |
The area of "computing with encrypted data" has been studied by numerous authors in the past twenty years since it is fundamental to understanding properties of encryption and it has many practical applications. The related fundamental area of "secure function evaluation" has been studied since the mid 80's. In its basic two-party case, two parties (Alice and Bob) evaluate a known circuit over private inputs (or a private input and a private circuit). Much attention has been paid to the important issue of minimizing rounds of computation in this model. Namely, the number of communication rounds in which Alice and Bob need to engage in to evaluate a circuit on encrypted data securely. Advancements in these areas have been recognized as open problems and have remained open for a number of years. In this paper we give a one round, and thus round optimal, protocol for secure evaluation of circuits which is in polynomial-time for NC1 circuits. The protocol involves an input party sending encrypted input to a second party, a cryptocomputer, which evaluates the circuit (or a known circuit over its additional private input) non-interactively, securely and obliviously, and provides the output to the input party without learning it.This improves on previous (general) results that are specialized to the case of NC1 circuits and require a constant number of communication rounds. We further suggest applications to network and mobile computing. The scenario also coincides with computing with encrypted data when the input is transformed into an output while remaining encrypted throughout the computation.New techniques are required for our highly constrained non-interactive setting. Naturally, some of these techniques are related to special properties of encryption schemes (we in fact, need probabilistic encryption schemes which are random self-reducible). Homomorphic encryption schemes are closely related to and useful in secure circuit evaluation. They have been associated with computations with encrypted data (as well as with many other cryptographic applications). Surprisingly, the known homomorphic schemes have been limited to a small number of algebraic structures, e.g. all the schemes we are aware of are homomorphic over groups. We also give a new provably secure public key scheme that allows the computation of the logical AND operation using encrypted data. This scheme is homomorphic over a semigroup (instead of a group) and thus also expands the range of algebraic structures which can be encrypted "homomorphically".