On expected polynomial time simulation of zero knowledge protocols

1991 ◽  
pp. 1-1
Author(s):  
U. Feige ◽  
A. Shmir
Keyword(s):  
Polynomial Time ◽  
Zero Knowledge ◽  
Time Simulation

scholarly journals MCRA: Multicost Rerouting Algorithm in SDN

2020 ◽  
Vol 24 (6) ◽  
pp. 728-737
Author(s):  
Kuangyu Qin ◽  
Bin Fu ◽  
Peng Chen ◽  
Jianhua Huang ◽  
◽  
...  
Keyword(s):  
Polynomial Time ◽  
Network Performance ◽  
Optimal Solution ◽  
Software Defined Network ◽  
Centralized Control ◽  
Time Simulation ◽  
Data Plane ◽  
Simulation Results ◽  
Approximate Optimal Solution ◽  
Main Factor

A software-defined network (SDN) partitions a network into a control plane and data plane. Utilizing centralized control, an SDN can accurately control the routing of data flow. In the network, links have various costs, such as bandwidth, delay, and hops. However, it is difficult to obtain a multicost optimization path. If online rerouting can be realized under multiple cost, then network performance can be improved. This paper proposes a multicost rerouting algorithm for elephant flow, as the latter is the main factor affecting network traffic. By performing path trimming, the algorithm can obtain the approximate optimal solution of (1+e) in polynomial time. Simulation results show that the proposed algorithm yields good performance.

scholarly journals Quantum-Resistant Network for Classical Client Compatibility

2021 ◽  
Vol 50 (2) ◽  
pp. 224-235
Author(s):  
Te-Yuan Lin ◽  
Chiou-Shann Fuh
Keyword(s):  
Quantum Computing ◽  
Polynomial Time ◽  
Time Complexity ◽  
Quantum Computer ◽  
Quantum Network ◽  
Network Infrastructure ◽  
Zero Knowledge ◽  
Shor's Algorithm ◽  
Computational Security ◽  
Computational Difficulty

Quantum computing is no longer a thing of the future. Shor’s algorithm proved that a quantum computer couldtraverse key of factoring problems in polynomial time. Because the time-complexity of the exhaustive keysearch for quantum computing has not reliably exceeded the reasonable expiry of crypto key validity, it is believedthat current cryptography systems built on top of computational security are not quantum-safe. Quantumkey distribution fundamentally solves the problem of eavesdropping; nevertheless, it requires quantumpreparatory work and quantum-network infrastructure, and these remain unrealistic with classical computers.In transitioning to a mature quantum world, developing a quantum-resistant mechanism becomes a stringentproblem. In this research, we innovatively tackled this challenge using a non-computational difficulty schemewith zero-knowledge proof in order to achieve repellency against quantum computing cryptanalysis attacks foruniversal classical clients.

scholarly journals Classical zero-knowledge arguments for quantum computations

Quantum ◽  
2020 ◽  
Vol 4 ◽  
pp. 266 ◽  
Author(s):  
Thomas Vidick ◽  
Tina Zhang
Keyword(s):  
Polynomial Time ◽  
Proof System ◽  
Knowledge Argument ◽  
Zero Knowledge ◽  
Quantum Computations ◽  
Quantum Polynomial ◽  
Zero Knowledge Proof

We show that every language in QMA admits a classical-verifier, quantum-prover zero-knowledge argument system which is sound against quantum polynomial-time provers and zero-knowledge for classical (and quantum) polynomial-time verifiers. The protocol builds upon two recent results: a computational zero-knowledge proof system for languages in QMA, with a quantum verifier, introduced by Broadbent et al. (FOCS 2016), and an argument system for languages in QMA, with a classical verifier, introduced by Mahadev (FOCS 2018).

Sign in / Sign up

Export Citation Format

Share Document