ADAPTIVE AND COMPOSABLE NON-INTERACTIVE STRING-COMMITMENT PROTOCOLS

2010 ◽  
Keyword(s):  
Commitment Protocols

An algebra for commitment protocols

2006 ◽  
Vol 14 (2) ◽  
pp. 143-163 ◽  
Author(s):  
Ashok U. Mallya ◽  
Munindar P. Singh
Keyword(s):  
Commitment Protocols

scholarly journals Summoning, No-Signalling and Relativistic Bit Commitments

Entropy ◽  
2019 ◽  
Vol 21 (5) ◽  
pp. 534
Author(s):  
Adrian Kent
Keyword(s):  
Necessary Conditions ◽  
Causal Structure ◽  
Distributed Networks ◽  
Space Time ◽  
Quantum Measurements ◽  
Bit Commitment ◽  
Projection Postulate ◽  
Independent Functioning ◽  
Commitment Protocols ◽  
Bit Commitments

Summoning is a task between two parties, Alice and Bob, with distributed networks of agents in space-time. Bob gives Alice a random quantum state, known to him but not her, at some point. She is required to return the state at some later point, belonging to a subset defined by communications received from Bob at other points. Many results about summoning, including the impossibility of unrestricted summoning tasks and the necessary conditions for specific types of summoning tasks to be possible, follow directly from the quantum no-cloning theorem and the relativistic no-superluminal-signalling principle. The impossibility of cloning devices can be derived from the impossibility of superluminal signalling and the projection postulate, together with assumptions about the devices’ location-independent functioning. In this qualified sense, known summoning results follow from the causal structure of space-time and the properties of quantum measurements. Bounds on the fidelity of approximate cloning can be similarly derived. Bit commitment protocols and other cryptographic protocols based on the no-summoning theorem can thus be proven secure against some classes of post-quantum but non-signalling adversaries.

scholarly journals GoCo: planning expressive commitment protocols

2018 ◽  
Vol 32 (4) ◽  
pp. 459-502 ◽  
Author(s):  
Felipe Meneguzzi ◽  
Mauricio C. Magnaguagno ◽  
Munindar P. Singh ◽  
Pankaj R. Telang ◽  
Neil Yorke-Smith
Keyword(s):  
Commitment Protocols

scholarly journals Engineering Foreign Exchange Processes via Commitment Protocols

2007 ◽  
Author(s):  
Nirmit Desai ◽  
Amit K. Chopra ◽  
Matthew Arrott ◽  
Bill Specht ◽  
Munindar P. Singh
Keyword(s):  
Foreign Exchange ◽  
Exchange Processes ◽  
Commitment Protocols

scholarly journals Strict Serializable Multidatabase Certification with Out-of-Order Updates

2021 ◽  
Author(s):  
Emil Koutanov
Keyword(s):  
Concurrency Control ◽  
Distributed Transactions ◽  
Optimistic Concurrency Control ◽  
Multi Phase ◽  
Commitment Protocols ◽  
The Coordinator ◽  
Atomic Commitment

Multi-phase atomic commitment protocols require long-lived resource locks on the participants and introduce blocking behaviour at the coordinator. They are also pessimistic in nature, preventing reads from executing concurrently with writes. Despite their known shortfalls, multi-phase protocols are the mainstay of transactional integration between autonomous, federated systems. This paper presents a novel atomic commitment protocol, STRIDE (Serializable Transactions in Decentralised Environments), that offers strict serializable certification of distributed transactions across autonomous, replicated sites. The protocol follows the principles of optimistic concurrency control, operating on the premise that conflicting transactions are infrequent. When they do occur, conflicting transactions are identified through antidependency testing on the certifier, which may be replicated for performance and availability. The majority of transactions can be certified entirely in memory. Unlike its multi-phase counterparts, STRIDE is nonblocking, decentralised and does not mandate the use of long-lived resource locks on the participants. It also offers a flexible isolation model for read-only transactions, which can be served directly from the participant sites without undergoing certification. Also, update transactions are Φ-serializable, making the certifier immune to the recently disclosed logical timestamp skew anomaly.

Model Checking Commitment Protocols

2011 ◽  
pp. 37-47
Author(s):  
Mohamed El-Menshawy ◽  
Jamal Bentahar ◽  
Rachida Dssouli
Keyword(s):  
Model Checking ◽  
Commitment Protocols
Sign in / Sign up

Export Citation Format

Share Document