The Experts below are selected from a list of 174 Experts worldwide ranked by ideXlab platform

Ali H. Homid - One of the best experts on this subject based on the ideXlab platform.

  • Efficient Protocol of $$N$$ N -bit discrete quantum Fourier transform via
    Quantum Information Processing, 2014
    Co-Authors: A.-s. F. Obada, H. A. Hessian, A.-b. A. Mohamed, Ali H. Homid
    Abstract:

    Based on the one- and two-qubit gates defined and generated via superconducting transmon qubits homogeneously coupled to a superconducting stripline resonator, we present a new Physical Protocol for implementing an $$N$$ N -bit discrete quantum Fourier transform. We propose and illustrate a detailed experimental feasibility for realizing the algorithm. The average fidelity is computed to prove the success of this algorithm. Estimated time for implementing the Protocol using the proposed scheme is compared with previous schemes. Estimates show that the Protocol can be successfully implemented within the present experimental limits.

  • Efficient Protocol of $$N$$N-bit discrete quantum Fourier transform via transmon qubits coupled to a resonator
    Quantum Information Processing, 2013
    Co-Authors: A.-s. F. Obada, H. A. Hessian, A.-b. A. Mohamed, Ali H. Homid
    Abstract:

    Based on the one- and two-qubit gates defined and generated via superconducting transmon qubits homogeneously coupled to a superconducting stripline resonator, we present a new Physical Protocol for implementing an $$N$$N-bit discrete quantum Fourier transform. We propose and illustrate a detailed experimental feasibility for realizing the algorithm. The average fidelity is computed to prove the success of this algorithm. Estimated time for implementing the Protocol using the proposed scheme is compared with previous schemes. Estimates show that the Protocol can be successfully implemented within the present experimental limits.

A.-s. F. Obada - One of the best experts on this subject based on the ideXlab platform.

  • Efficient Protocol of $$N$$ N -bit discrete quantum Fourier transform via
    Quantum Information Processing, 2014
    Co-Authors: A.-s. F. Obada, H. A. Hessian, A.-b. A. Mohamed, Ali H. Homid
    Abstract:

    Based on the one- and two-qubit gates defined and generated via superconducting transmon qubits homogeneously coupled to a superconducting stripline resonator, we present a new Physical Protocol for implementing an $$N$$ N -bit discrete quantum Fourier transform. We propose and illustrate a detailed experimental feasibility for realizing the algorithm. The average fidelity is computed to prove the success of this algorithm. Estimated time for implementing the Protocol using the proposed scheme is compared with previous schemes. Estimates show that the Protocol can be successfully implemented within the present experimental limits.

  • Efficient Protocol of $$N$$N-bit discrete quantum Fourier transform via transmon qubits coupled to a resonator
    Quantum Information Processing, 2013
    Co-Authors: A.-s. F. Obada, H. A. Hessian, A.-b. A. Mohamed, Ali H. Homid
    Abstract:

    Based on the one- and two-qubit gates defined and generated via superconducting transmon qubits homogeneously coupled to a superconducting stripline resonator, we present a new Physical Protocol for implementing an $$N$$N-bit discrete quantum Fourier transform. We propose and illustrate a detailed experimental feasibility for realizing the algorithm. The average fidelity is computed to prove the success of this algorithm. Estimated time for implementing the Protocol using the proposed scheme is compared with previous schemes. Estimates show that the Protocol can be successfully implemented within the present experimental limits.

Moni Naor - One of the best experts on this subject based on the ideXlab platform.

  • cryptographic and Physical zero knowledge proof systems for solutions of sudoku puzzles
    Theory of Computing Systems \ Mathematical Systems Theory, 2009
    Co-Authors: Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N Rothblum
    Abstract:

    We consider cryptographic and Physical zero-knowledge proof schemes for Sudoku, a popular combinatorial puzzle. We discuss methods that allow one party, the prover, to convince another party, the verifier, that the prover has solved a Sudoku puzzle, without revealing the solution to the verifier. The question of interest is how a prover can show: (i) that there is a solution to the given puzzle, and (ii) that he knows the solution, while not giving away any information about the solution to the verifier. In this paper we consider several Protocols that achieve these goals. Broadly speaking, the Protocols are either cryptographic or Physical. By a cryptographic Protocol we mean one in the usual model found in the foundations of cryptography literature. In this model, two machines exchange messages, and the security of the Protocol relies on computational hardness. By a Physical Protocol we mean one that is implementable by humans using common objects, and preferably without the aid of computers. In particular, our Physical Protocols utilize items such as scratch-off cards, similar to those used in lotteries, or even just simple playing cards. The cryptographic Protocols are direct and efficient, and do not involve a reduction to other problems. The Physical Protocols are meant to be understood by “lay-people” and implementable without the use of computers.

  • cryptographic and Physical zero knowledge proof systems for solutions of sudoku puzzles
    Fun with Algorithms, 2007
    Co-Authors: Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N Rothblum
    Abstract:

    We consider cryptographic and Physical zero-knowledge proof schemes for Sudoku, a popular combinatorial puzzle. We discuss methods that allow one party, the prover, to convince another party, the verifier, that the prover has solved a Sudoku puzzle, without revealing the solution to the verifier. The question of interest is how a prover can show: (i) that there is a solution to the given puzzle, and (ii) that he knows the solution, while not giving away any information about the solution to the verifier. In this paper we consider several Protocols that achieve these goals. Broadly speaking, the Protocols are either cryptographic or Physical. By a cryptographic Protocol we mean one in the usual model found in the foundations of cryptography literature. In this model, two machines exchange messages, and the security of the Protocol relies on computational hardness. By a Physical Protocol we mean one that is implementable by humans using common objects, and preferably without the aid of computers. In particular, our Physical Protocols utilize scratch-off cards, similar to those used in lotteries, or even just simple playing cards. The cryptographic Protocols are direct and efficient, and do not involve a reduction to other problems. The Physical Protocols are meant to be understood by "lay-people" and implementablewithout the use of computers.

  • FUN - Cryptographic and Physical zero-knowledge proof systems for solutions of sudoku puzzles
    Lecture Notes in Computer Science, 2007
    Co-Authors: Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N Rothblum
    Abstract:

    We consider cryptographic and Physical zero-knowledge proof schemes for Sudoku, a popular combinatorial puzzle. We discuss methods that allow one party, the prover, to convince another party, the verifier, that the prover has solved a Sudoku puzzle, without revealing the solution to the verifier. The question of interest is how a prover can show: (i) that there is a solution to the given puzzle, and (ii) that he knows the solution, while not giving away any information about the solution to the verifier. In this paper we consider several Protocols that achieve these goals. Broadly speaking, the Protocols are either cryptographic or Physical. By a cryptographic Protocol we mean one in the usual model found in the foundations of cryptography literature. In this model, two machines exchange messages, and the security of the Protocol relies on computational hardness. By a Physical Protocol we mean one that is implementable by humans using common objects, and preferably without the aid of computers. In particular, our Physical Protocols utilize scratch-off cards, similar to those used in lotteries, or even just simple playing cards. The cryptographic Protocols are direct and efficient, and do not involve a reduction to other problems. The Physical Protocols are meant to be understood by "lay-people" and implementablewithout the use of computers.

  • polling with Physical envelopes a rigorous analysis of a human centric Protocol
    Lecture Notes in Computer Science, 2006
    Co-Authors: Tal Moran, Moni Naor
    Abstract:

    We propose simple, realistic Protocols for polling that allow the responder to plausibly repudiate his response, while at the same time allow accurate statistical analysis of poll results. The Protocols use simple Physical objects (envelopes or scratch-off cards) and can be performed without the aid of computers. One of the main innovations of this work is the use of techniques from theoretical cryptography to rigorously prove the security of a realistic, Physical Protocol. We show that, given a few properties of Physical envelopes, the Protocols are unconditionally secure in the universal composability framework.

  • EUROCRYPT - Polling with Physical envelopes: a rigorous analysis of a human-centric Protocol
    Advances in Cryptology - EUROCRYPT 2006, 2006
    Co-Authors: Tal Moran, Moni Naor
    Abstract:

    We propose simple, realistic Protocols for polling that allow the responder to plausibly repudiate his response, while at the same time allow accurate statistical analysis of poll results. The Protocols use simple Physical objects (envelopes or scratch-off cards) and can be performed without the aid of computers. One of the main innovations of this work is the use of techniques from theoretical cryptography to rigorously prove the security of a realistic, Physical Protocol. We show that, given a few properties of Physical envelopes, the Protocols are unconditionally secure in the universal composability framework.

Guy N Rothblum - One of the best experts on this subject based on the ideXlab platform.

  • cryptographic and Physical zero knowledge proof systems for solutions of sudoku puzzles
    Theory of Computing Systems \ Mathematical Systems Theory, 2009
    Co-Authors: Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N Rothblum
    Abstract:

    We consider cryptographic and Physical zero-knowledge proof schemes for Sudoku, a popular combinatorial puzzle. We discuss methods that allow one party, the prover, to convince another party, the verifier, that the prover has solved a Sudoku puzzle, without revealing the solution to the verifier. The question of interest is how a prover can show: (i) that there is a solution to the given puzzle, and (ii) that he knows the solution, while not giving away any information about the solution to the verifier. In this paper we consider several Protocols that achieve these goals. Broadly speaking, the Protocols are either cryptographic or Physical. By a cryptographic Protocol we mean one in the usual model found in the foundations of cryptography literature. In this model, two machines exchange messages, and the security of the Protocol relies on computational hardness. By a Physical Protocol we mean one that is implementable by humans using common objects, and preferably without the aid of computers. In particular, our Physical Protocols utilize items such as scratch-off cards, similar to those used in lotteries, or even just simple playing cards. The cryptographic Protocols are direct and efficient, and do not involve a reduction to other problems. The Physical Protocols are meant to be understood by “lay-people” and implementable without the use of computers.

  • cryptographic and Physical zero knowledge proof systems for solutions of sudoku puzzles
    Fun with Algorithms, 2007
    Co-Authors: Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N Rothblum
    Abstract:

    We consider cryptographic and Physical zero-knowledge proof schemes for Sudoku, a popular combinatorial puzzle. We discuss methods that allow one party, the prover, to convince another party, the verifier, that the prover has solved a Sudoku puzzle, without revealing the solution to the verifier. The question of interest is how a prover can show: (i) that there is a solution to the given puzzle, and (ii) that he knows the solution, while not giving away any information about the solution to the verifier. In this paper we consider several Protocols that achieve these goals. Broadly speaking, the Protocols are either cryptographic or Physical. By a cryptographic Protocol we mean one in the usual model found in the foundations of cryptography literature. In this model, two machines exchange messages, and the security of the Protocol relies on computational hardness. By a Physical Protocol we mean one that is implementable by humans using common objects, and preferably without the aid of computers. In particular, our Physical Protocols utilize scratch-off cards, similar to those used in lotteries, or even just simple playing cards. The cryptographic Protocols are direct and efficient, and do not involve a reduction to other problems. The Physical Protocols are meant to be understood by "lay-people" and implementablewithout the use of computers.

  • FUN - Cryptographic and Physical zero-knowledge proof systems for solutions of sudoku puzzles
    Lecture Notes in Computer Science, 2007
    Co-Authors: Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N Rothblum
    Abstract:

    We consider cryptographic and Physical zero-knowledge proof schemes for Sudoku, a popular combinatorial puzzle. We discuss methods that allow one party, the prover, to convince another party, the verifier, that the prover has solved a Sudoku puzzle, without revealing the solution to the verifier. The question of interest is how a prover can show: (i) that there is a solution to the given puzzle, and (ii) that he knows the solution, while not giving away any information about the solution to the verifier. In this paper we consider several Protocols that achieve these goals. Broadly speaking, the Protocols are either cryptographic or Physical. By a cryptographic Protocol we mean one in the usual model found in the foundations of cryptography literature. In this model, two machines exchange messages, and the security of the Protocol relies on computational hardness. By a Physical Protocol we mean one that is implementable by humans using common objects, and preferably without the aid of computers. In particular, our Physical Protocols utilize scratch-off cards, similar to those used in lotteries, or even just simple playing cards. The cryptographic Protocols are direct and efficient, and do not involve a reduction to other problems. The Physical Protocols are meant to be understood by "lay-people" and implementablewithout the use of computers.

H. A. Hessian - One of the best experts on this subject based on the ideXlab platform.

  • Efficient Protocol of $$N$$ N -bit discrete quantum Fourier transform via
    Quantum Information Processing, 2014
    Co-Authors: A.-s. F. Obada, H. A. Hessian, A.-b. A. Mohamed, Ali H. Homid
    Abstract:

    Based on the one- and two-qubit gates defined and generated via superconducting transmon qubits homogeneously coupled to a superconducting stripline resonator, we present a new Physical Protocol for implementing an $$N$$ N -bit discrete quantum Fourier transform. We propose and illustrate a detailed experimental feasibility for realizing the algorithm. The average fidelity is computed to prove the success of this algorithm. Estimated time for implementing the Protocol using the proposed scheme is compared with previous schemes. Estimates show that the Protocol can be successfully implemented within the present experimental limits.

  • Efficient Protocol of $$N$$N-bit discrete quantum Fourier transform via transmon qubits coupled to a resonator
    Quantum Information Processing, 2013
    Co-Authors: A.-s. F. Obada, H. A. Hessian, A.-b. A. Mohamed, Ali H. Homid
    Abstract:

    Based on the one- and two-qubit gates defined and generated via superconducting transmon qubits homogeneously coupled to a superconducting stripline resonator, we present a new Physical Protocol for implementing an $$N$$N-bit discrete quantum Fourier transform. We propose and illustrate a detailed experimental feasibility for realizing the algorithm. The average fidelity is computed to prove the success of this algorithm. Estimated time for implementing the Protocol using the proposed scheme is compared with previous schemes. Estimates show that the Protocol can be successfully implemented within the present experimental limits.