Sciweavers

5722 search results - page 542 / 1145
» Security Function Interactions
Sort
View
140
Voted
EUROCRYPT
2001
Springer
15 years 9 months ago
How to Convert the Flavor of a Quantum Bit Commitment
In this paper we show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealin...
Claude Crépeau, Frédéric L&ea...
146
Voted
AUSAI
1998
Springer
15 years 9 months ago
cardTAP: Automated Deduction on a Smart Card
We present the rst implementation of a theorem prover which runs on a smart card. The prover is written in Java and implements a dual tableau calculus.1 Due to the limited resource...
Andrew Slater, Rajeev Goré, Joachim Posegga...
ISW
1997
Springer
15 years 9 months ago
Cryptanalysis of Message Authentication Codes
This paper gives a survey of attacks on Message Authentication Codes (MACs). First it defines the required security properties. Next it describes generic forgery and key recovery...
Bart Preneel
ICDE
1993
IEEE
147views Database» more  ICDE 1993»
15 years 9 months ago
Large Object Support in POSTGRES
This paper presents four implementations for support of large objects in POSTGRES. The four implementations offer varying levels of support for security, transactions, compression...
Michael Stonebraker, Michael A. Olson
170
Voted
FSE
1997
Springer
246views Cryptology» more  FSE 1997»
15 years 8 months ago
Fast Message Authentication Using Efficient Polynomial Evaluation
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
Valentine Afanassiev, Christian Gehrmann, Ben J. M...