Minimal-Latency Secure Function Evaluation

No abstract is available for this paper.

• Publication year

  2000

• Venue

  International Conference on the Theory and Application of Cryptographic Techniques

• Publication date

  2000-05-14

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/3-540-45539-6_23
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Minimal Model for Secure Computation

  2002cited by this paper
• Non-interactive cryptocomputing for NC/sup 1/

  1999influential reference
• On the Security of ElGamal Based Encryption

  1998cited by this paper
• Number-theoretic constructions of efficient pseudo-random functions

  1997cited by this paper
• Fair exchange with a semi-trusted third party (extended abstract)

  1997cited by this paper
• A minimal model for secure computation (extended abstract)

  1994cited by this paper
• Computing Algebraic Formulas Using a Constant Number of Registers

  1992cited by this paper
• Advances in cryptology--CRYPTO '91 : proceedings

  1992cited by this paper
• Oblivous Transfer Protecting Secrecy

  1991cited by this paper
• Efficient Multiparty Protocols Using Circuit Randomization

  1991cited by this paper
• Uses of randomness in algorithms and protocols

  1990influential reference
• The round complexity of secure protocols

  1990cited by this paper
• Non-cryptographic fault-tolerant computing in constant number of rounds of interaction

  1989cited by this paper
• Completeness theorems for non-cryptographic fault-tolerant distributed computation

  1988cited by this paper
• Founding crytpography on oblivious transfer

  1988influential reference
• Computing algebraic formulas with a constant number of registers

  1988cited by this paper
• Multiparty unconditionally secure protocols

  1988cited by this paper
• Advances in cryptology -- CRYPTO '87 : proceedings

  1988cited by this paper
• How to play ANY mental game

  1987cited by this paper
• Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

  1986cited by this paper
• How to Prove Yourself: Practical Solutions to Identification and Signature Problems

  1986cited by this paper
• Proofs that yield nothing but their validity and a methodology of cryptographic protocol design

  1986cited by this paper
• Protocols for secure computations

  1982cited by this paper
• How to share a secret

  1979cited by this paper
• Safeguarding cryptographic keys

  1899cited by this paper

• Distributed and secure linear algebra - Master Thesis

  2022cites this paper
• MPC with Friends and Foes

  2020cites this paper
• A brief history on Homomorphic learning: A privacy-focused approach to machine learning

  2020cites this paper
• Privacy-preserving Distributed Access Control for Medical Data

  2018cites this paper
• Parameter Constraints on Homomorphic Encryption Over the Integers

  2017cites this paper
• On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols

  2016cites this paper
• Cloud Computing Algebraic Homomorphic Encryption Scheme

  2014cites this paper
• Eat the Cake and Have It Too: Privacy Preserving Location Aggregates in Geosocial Networks

  2013cites this paper
• Short Round Sub-Linear Zero-Knowledge Argument for Linear Algebraic Relations

  2012cites this paper
• Secure computation with minimal interaction

  2012influential citation
• Analysis and Design of Secure Sealed-Bid Auction

  2011cites this paper
• Round-Efficient Sub-linear Zero-Knowledge Arguments for Linear Algebra

  2011cites this paper
• Secure Multiparty Computation with Minimal Interaction

  2010cites this paper
• Lower Bounds for Round and Communication Complexities of Unconditional Verifiable Secret Sharing

  2010cites this paper
• Fully homomorphic encryption using ideal lattices

  2009cites this paper
• Practical Private DNA String Searching and Matching through Efficient Oblivious Automata Evaluation

  2009cites this paper
• The Linux Kernel

  2009cites this paper
• Algebraic Techniques for Low Communication Secure Protocols

  2009cites this paper
• Secure Multi-party Computation Minimizing Online Rounds

  2009cites this paper
• Private and Cheating-Free Outsourcing of Algebraic Computations

  2008cites this paper
• Enhancing Privacy in Remote Data Classification

  2008cites this paper
• Two-Party Computing with Encrypted Data

  2007cites this paper
• Secure Multiparty Computation of DNF

  2007influential citation
• A novel solution to the millionaire problem

  2007cites this paper
• Evaluating Branching Programs on Encrypted Data

  2007cites this paper
• A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra

  2007cites this paper
• Secure two-party computation and communication

  2006cites this paper
• Unconditionally Secure Constant Round Multi-Party Computation for Equality, Comparison, Bits and Exponentiation

  2006influential citation
• Ciphertext Comparison, a New Solution to the Millionaire Problem

  2005cites this paper
• Empirical Evaluation of Secure Two-Party Computation Models

  2005cites this paper
• Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation

  2005cites this paper
• Secure and private online collaboration

  2005cites this paper
• An Efficient and Verifiable Solution to the Millionaire Problem

  2004influential citation
• Efficient Simultaneous Contract Signing

  2004cites this paper
• Efficient Multi-party Computation over Rings

  2003influential citation
• Secure Multi-Player Protocols: Fundamentals, Generality, and Efficiency

  2003cites this paper
• Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials

  2002cites this paper
• A Two-Server, Sealed-Bid Auction Protocol

  2002cites this paper
• A Two-Server , Sealed-Bid Auction Protocol ( Extended Abstract )

  2002cites this paper
• On 2-Round Secure Multiparty Computation

  2002influential citation
• A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires

  2001cites this paper
• The round complexity of verifiable secret sharing and secure multicast

  2001cites this paper
• Secure Distributed Linear Algebra in a Constant Number of Rounds

  2001cites this paper
• Randomizing polynomials: A new representation with applications to round-efficient secure computation

  2000influential citation
• Perfect 2-Party Computation from Additive Somewhat Homomorphic Encryption

  year unknowncites this paper
• Perfect Somewhat Homomorphic Encryption and 2-Party Computation

  year unknowncites this paper