Sciweavers

1816 search results - page 20 / 364
» Trace oblivious computation
Sort
View
DAGSTUHL
2006
13 years 11 months ago
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment
It is well known that unconditionally secure bit commitment is impossible even in the quantum world. In this paper a weak variant of quantum bit commitment, introduced independent...
Andreas Jakoby, Maciej Liskiewicz, Aleksander Madr...
EUROCRYPT
1995
Springer
14 years 1 months ago
Quantum Oblivious Mutual Identification
We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and e...
Claude Crépeau, Louis Salvail
SETA
2004
Springer
122views Mathematics» more  SETA 2004»
14 years 3 months ago
New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP)
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
Kenneth J. Giuliani, Guang Gong
PKC
2010
Springer
148views Cryptology» more  PKC 2010»
14 years 1 months ago
On the Feasibility of Consistent Computations
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
Sven Laur, Helger Lipmaa
CIKM
2009
Springer
14 years 4 months ago
A framework for safely publishing communication traces
A communication trace is a detailed record of the communication between two entities. Communication traces are vital for research in computer networks and protocols in many domain...
Abhinav Parate, Gerome Miklau