Sciweavers

94 search results - page 10 / 19
» New lattice based cryptographic constructions
Sort
View
POPL
2001
ACM
14 years 9 months ago
Mobile values, new names, and secure communication
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...
Cédric Fournet, Martín Abadi
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
14 years 2 months ago
A New Interactive Hashing Theorem
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
Iftach Haitner, Omer Reingold
ICRA
2006
IEEE
77views Robotics» more  ICRA 2006»
14 years 2 months ago
Scalable Shape Sculpting via Hole Motion: Motion Planning in Lattice-constrained Modular Robots
— We describe a novel shape formation algorithm for ensembles of 2-dimensional lattice-arrayed modular robots, based on the manipulation of regularly shaped voids within the latt...
Michael DeRosa, Seth Copen Goldstein, Peter Lee, J...
ASIACRYPT
2011
Springer
12 years 8 months ago
BiTR: Built-in Tamper Resilience
The assumption of the availability of tamper-proof hardware tokens has been used extensively in the design of cryptographic primitives. For example, Katz (Eurocrypt 2007) suggests ...
Seung Geol Choi, Aggelos Kiayias, Tal Malkin
AMW
2010
13 years 10 months ago
Certification and Authentication of Data Structures
We study query authentication schemes, algorithmic and cryptographic constructions that provide efficient and secure protocols for verifying the results of queries over structured...
Roberto Tamassia, Nikos Triandopoulos