#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2012

2017

- This year (1)
- Last 5 years (12)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Alisa Pankova, Peeter Laud
- 2012 IEEE 25th Computer Security Foundationsâ€¦
- 2012

Bilinear pairings are powerful mathematical structures that can be used in cryptography. Their equational properties allow constructing cryptographic primitives and protocols that would be otherwise ineffective or even impossible. In formal cryptography, the protocols are expressed through term algebras and process calculi. ProVerif, one of the mostâ€¦ (More)

- Peeter Laud, Alisa Pankova
- IACR Cryptology ePrint Archive
- 2015

This paper presents a generic method for turning passively secure protocols into protocols secure against covert attacks, adding an offline preprocessing and a cheap post-execution verification phase. The execution phase, after which the computed result is already available to the parties, has only negligible overhead. Our method uses shared verificationâ€¦ (More)

- Peeter Laud, Alisa Pankova
- CCSW
- 2013

In this paper we study the security definitions and methods for transformation-based outsourcing of linear programming. The recent attacks have shown the deficiencies of existing security definitions; thus we propose a stronger, indistinguishability-based definition of security of problem transformations that is very similar to IND-CPA security ofâ€¦ (More)

- Peeter Laud, Alisa Pankova
- STM
- 2013

In this paper we demonstrate a number of attacks against proposed protocols for privacypreserving linear programming, based on publishing and solving a transformed version of the problem instance. Our attacks exploit the geometric structure of the problem, which has mostly been overlooked in the previous analyses and is largely preserved by the proposedâ€¦ (More)

- Peeter Laud, Alisa Pankova
- IACR Cryptology ePrint Archive
- 2015

Frequent itemset mining is a task that can in turn be used for other purposes such as associative rule mining. One problem is that the data may be sensitive, and its owner may refuse to give it for analysis in plaintext. There exist many privacy-preserving solutions for frequent itemset mining, but in any case enhancing the privacy inevitably spoils theâ€¦ (More)

- Peeter Laud, Alisa Pankova
- IACR Cryptology ePrint Archive
- 2015

This paper studies the possibility of achieving indistinguishabilitybased security in privately outsourcing linear equation systems over real numbers. The particular task is to solve a full-rank nÃ— n system Ax = b. Since the most complex part of this task is inverting A, the problem can be reduced to outsourcing of a square matrix inverse computation.â€¦ (More)

- Peeter Laud, Alisa Pankova, Martin Pettai, Jaak Randmets
- PETShop@CCS
- 2013

In this paper, we discuss the design choices and initial experiences with a domain-specific language and its optimizing compiler for specifying protocols for secure computation. We give the rationale of the design, describe the translation steps, the location of the compiler in the whole Sharemind protocol stack, and the results we have obtained with theâ€¦ (More)

- Alisa Pankova
- 2013

Verifiable computation in zero knowledge allows the verifier to prove that he performed the computation of a certain functionality correctly without having to repeat the entire computational process, and without revealing any details of the computation. Any program can be represented by a circuit, and verifying the correctness of the computation isâ€¦ (More)

- Peeter Laud, Alisa Pankova
- ProvSec
- 2014

We present a generic method for turning passively secure protocols into protocols secure against covert attacks. The method adds a post-execution verification phase to the protocol that allows a misbehaving party to escape detection only with negligible probability. The execution phase, after which the computed protocol result is already available forâ€¦ (More)

- Peeter Laud, Alisa Pankova
- ICICS
- 2016

Secure multiparty computation platforms are often provided with a programming language that allows to write privacy-preserving applications without thinking of the underlying cryptography. The control flow of these programs is expensive to hide, hence they typically disallow branching on private values. The application programmers have to specify theirâ€¦ (More)