Sciweavers

53 search results - page 5 / 11
» Bilinear Groups of Composite Order
Sort
View
CRYPTO
2005
Springer
164views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
Composition Does Not Imply Adaptive Security
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
Krzysztof Pietrzak
IJUFKS
2000
65views more  IJUFKS 2000»
14 years 9 months ago
Some Group Theoretic Aspects of t-Norms
Continuous archimedean t-norms are generated by automorphisms f of ([0; 1]; ), the unit interval with its usual order structure. Such strict t-norms 4 are given by x 4 y = f 1 (f(...
Fred Richman, Elbert A. Walker
ASIACRYPT
2005
Springer
15 years 3 months ago
Spreading Alerts Quietly and the Subgroup Escape Problem
We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has n...
James Aspnes, Zoë Diamadi, Kristian Gjø...
AINA
2007
IEEE
15 years 1 months ago
Collision prevention using group communication for asynchronous cooperative mobile robots
The paper presents a fail-safe mobility management and a collision prevention platform for a group of asynchronous cooperative mobile robots. The fail-safe platform consists of a ...
Rami Yared, Xavier Défago, Matthias Wiesman...
JNW
2007
118views more  JNW 2007»
14 years 9 months ago
Collision Prevention Platform for a Dynamic Group of Asynchronous Cooperative Mobile Robots
— This paper presents a fail-safe platform on which cooperative mobile robots rely for their motion. The platform consists of a collision prevention protocol for a dynamic group ...
Rami Yared, Xavier Défago, Julien Iguchi-Ca...