A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Bounded memory protocols

2014
*
Computer languages, systems & structures
*

We showed that this

doi:10.1016/j.cl.2014.05.003
fatcat:tsydq6ohhzcnnncl25te5drp4i
*Bounded**Memory*Dolev-Yao adversary, when given enough*memory*, can carry out many existing*protocol*anomalies. ... This led us to the question of whether it is possible to infer an upper-*bound*on the*memory*required by the Dolev-Yao adversary to carry out an anomaly from the*memory*restrictions of the*bounded**protocol*...*Bounded**Memory**Protocols*A*bounded**memory**protocol*, formally defined below, only contains balanced actions [KKNS] . ...##
###
Bounded Memory Protocols and Progressing Collaborative Systems
[chapter]

2013
*
Lecture Notes in Computer Science
*

We showed that this

doi:10.1007/978-3-642-40203-6_18
fatcat:ecgpuo2pqzhrvak4o3pdcrxpmq
*Bounded**Memory*Dolev-Yao adversary, when given enough*memory*, can carry out many existing*protocol*anomalies. ... In particular, the known anomalies arise for*bounded**memory**protocols*, where there is only a*bounded*number of concurrent sessions and the honest participants of the*protocol*cannot generate an unbounded ... In*bounded**memory**protocols*, one considers that the*memory*of the system is*bounded*. ...##
###
An Efficient Distance Bounding RFID Authentication Protocol: Balancing False-Acceptance Rate and Memory Requirement
[chapter]

2009
*
Lecture Notes in Computer Science
*

Can increase the transmission speed on the channel up to a given

doi:10.1007/978-3-642-04474-8_21
fatcat:g2xqz7e3yfe3zapb7mazexhqoy
*bound*(speed of light). ... Gildas Avoine and Aslan Tchamkerten -Distance*Bounding*RFID Authentication*Protocol*... This decreases the needed*memory*down to 256 bytes (0.25 Kbytes). Conclusion The first*protocol*that requires no signature and with a FAR less than (3/4) n . Are such*protocols*practicable? ...##
###
Space-bounded communication complexity

2013
*
Proceedings of the 4th conference on Innovations in Theoretical Computer Science - ITCS '13
*

We exhibit natural

doi:10.1145/2422436.2422456
dblp:conf/innovations/BrodyCPSS13
fatcat:rllcbt4e5ndn7jf5dr6zbq2boe
*protocols*where this semi-obliviousness shows up. For this model we also introduce new techniques through which certain limitations of space-*bounded*computation are revealed. ... We obtain*memory*hierarchy theorems (also comparing this general model with its restricted variants), and show super-linear lower*bounds*for some explicit (non-boolean) functions. ... Suppose that there is a*protocol*P with*memory*size*bound*s(n) that correctly computes All-EQ. ...##
###
Investigating Optimal Progress Measures for Verification of the WebSocket Protocol

2014
*
Norsk Informatikkonferanse
*

We derive lower

dblp:conf/nik/Kristensen14
fatcat:ljzp4fmuxzf4npe47n4x7h7eyy
*bounds*for the peak number states and present initial experimental results on near optimal progress measures for verification of the IETF WebSocket*protocol*. ... The method relies on a progress measure capturing inherent progress in the system under verification to store only fragments of the state space in*memory*at a time and thereby reduce peak*memory*usage. ... Then, max scc∈SCC |scc|+|Out(scc)| is a lower*bound*for the peak number of states stored with the internal*memory*implementation, and max scc∈SCC |scc| is a lower*bound*for the hybrid external-*memory*implementation ...##
###
Composable Security in the Bounded-Quantum-Storage Model
[article]

2007
*
arXiv
*
pre-print

In particular, we give a new, simulation-based, definition for security in the

arXiv:0709.0492v1
fatcat:jzm3gcbcgrhkjpvva3qy6wqfwi
*bounded*-quantum-storage model, and show that this definition allows for sequential composition of*protocols*. ... Finally, we prove the security of their randomized oblivious transfer*protocol*in our refined model. ... Second, the*memory**bound*is only enforced at one specific step in their*protocol*, while during the rest of the*protocol*, the adversary is allowed unlimited*memory*. ...##
###
Beating direct transmission bounds for quantum key distribution with a multiple quantum memory station
[article]

2019
*
arXiv
*
pre-print

[Applied Physics B 122, 96 (2016)] proposed a

arXiv:1910.10962v1
fatcat:rxz37aywxnhj7mc4gghudcf7hi
*protocol*to beat a repeaterless*bound*using one pair of quantum*memories*. ... Overcoming repeaterless*bounds*for the secret key rate capacity of quantum key distribution*protocols*is still a challenge with current technology. D. Luong et al. ... FIG. 3 : 3 Regions in the η total − T2*memory*parameter space where the extended*protocol*beats the PLOB*bound*, given that Alice and Bob have m pairs of*memories*between them. ...##
###
Refining Landauer's Stack: Balancing Error and Dissipation When Erasing Information

2021
*
Journal of statistical physics
*

AbstractNonequilibrium information thermodynamics determines the minimum energy dissipation to reliably erase

doi:10.1007/s10955-021-02733-1
fatcat:x55tavhnkvee7ep3nmvpzkv4j4
*memory*under time-symmetric control*protocols*. ... We demonstrate that its*bounds*are tight and so show that the costs overwhelm those implied by Landauer's energy*bound*on information erasure. ... Thus, we see that all simulated*protocols*satisfy the*bound*W ≥ W t-sym min . Furthermore, many simulated*protocols*end up quite close to their exact*bound*. ...##
###
Concurrent Composition in the Bounded Quantum Storage Model
[chapter]

2011
*
Lecture Notes in Computer Science
*

We define the BQS-UC model, a variant of the UC model, that deals with

doi:10.1007/978-3-642-20465-4_26
fatcat:mvwirul7zzeq5bjgmt2hqmmhtu
*protocols*in the*bounded*quantum storage model. ... We present a statistically secure commitment*protocol*in the BQS-UC model that composes concurrently with other*protocols*and an (a-priori) polynomially-*bounded*number of instances of itself. ... (Again, this holds for any n and any*memory**bound*, but the*protocol*depends on n and the*memory*-*bound*.) The roundcomplexity of the*protocol*is linear in the circuit depth. ...##
###
Distance Lower Bounding
[chapter]

2015
*
Lecture Notes in Computer Science
*

Distance (upper)-

doi:10.1007/978-3-319-21966-0_7
fatcat:lgnmluuctjat3ecjqqnh6utxvm
*bounding*(DUB) allows a verifier to know whether a proving party is located within a certain distance*bound*. ... We consider the dual problem of distance lower*bounding*(DLB), where the prover proves it is outside a distance*bound*to the verifier. ... A.2*Bounded**memory*and*bounded*retrieval model*Memory**bounded*adversaries in cryptography were first considered in information theoretic setting [8] . ...##
###
Blocking Optimality in Distributed Real-Time Locking Protocols

2013
*
Leibniz Transactions on Embedded Systems
*

Prior work on suspension-based shared-

doi:10.4230/lites-v001-i002-a001
dblp:journals/lites/Brandenburg14
fatcat:mha3y2sqnjgphdzfvhhnyadbte
*memory*multiprocessor locking*protocols*(which require resources to be accessible from all processors) has established asymptotically tight*bounds*of Ω(m) and Ω(n) ... In this paper, it is shown that, in the case of distributed semaphore*protocols*, there exist two different task allocation scenarios that give rise to distinct lower*bounds*. ... shared-*memory*semaphore*protocols*. ...##
###
Streaming Communication Protocols
[article]

2016
*
arXiv
*
pre-print

The inputs arrive as data streams and each agent has a

arXiv:1609.07059v1
fatcat:ia2enysdl5f7hethszb6nod74a
*bounded**memory*. ... We provide tight tradeoffs between the necessary resources, i.e. communication and*memory*, for some of the canonical problems from communication complexity by proving a strong general lower*bound*technique ... We are going to find a*protocol*Π +1 for IP αS , in the usual model (without streams and*bounded**memory*) using less than R +1 × (S + logαS) + 20S bits in expectation and error ≤ ε. ...##
###
Brief announcement

2013
*
Proceedings of the 2013 ACM symposium on Principles of distributed computing - PODC '13
*

When the

doi:10.1145/2484239.2484289
dblp:conf/podc/BlinT13
fatcat:b3ehjxpzs5gbtooym6m5xugkam
*protocol*is required to be silent (i.e., when communication content remains fixed from some point in time during any execution), there exists a lower*bound*of Ω(log n) bits of*memory*per node ... We present a new deterministic (non-silent) self-stabilizing*protocol*for n-node rings that uses only O(log log n)*memory*bits per node, and stabilizes in O(n log 2 n) time. ... A key component of this lower*bound*is that it holds only whenever the*protocol*is assumed to be silent. ...##
###
Comparing distance bounding protocols: A critical mission supported by decision theory

2015
*
Computer Communications
*

Distance

doi:10.1016/j.comcom.2015.06.007
fatcat:nliomyu4mzar5jmpmeasighcvy
*bounding**protocols*are security countermeasures designed to thwart relay attacks. ... The methodology allows for a multi-criteria comparison of distance*bounding**protocols*, thereby identifying the most appropriate*protocols*once the context is provided. ... Considering the prover's*memory*instead of the verifier's*memory*is motivated by the prevailing design of distance*bounding**protocols*where the prover needs to pre-compute all the possible answers before ...##
###
A Novel RFID Distance Bounding Protocol Based on Physically Unclonable Functions
[chapter]

2012
*
Lecture Notes in Computer Science
*

Distance

doi:10.1007/978-3-642-25286-0_6
fatcat:d7of7ql3rzbovmlkf4ku5cihby
*bounding**protocols*are particularly designed as a countermeasure against these attacks. ... Next, we propose a novel RFID distance*bounding**protocol*based on PUFs which satisfies the expected security requirements. ... One of the main problems of existing distance*bounding**protocols*is storing the long-term key into its*memory*which can be obtained by a fraudulent prover. ...
« Previous

*Showing results 1 — 15 out of 201,203 results*